This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A322923 #17 Sep 08 2022 08:46:23
%S A322923 13,19,37,43,61,73,97,127,163,181,223,241,271,307,313,331,397,421,457,
%T A322923 523,541,547,577,601,673,691,727,757,811,853,883,937,997,1051,1063,
%U A322923 1123,1153,1171,1231,1297,1303,1321,1531,1567,1627,1693,1783,1801
%N A322923 Primes of the form 3*p + 4, where p is a prime.
%H A322923 Muniru A Asiru, <a href="/A322923/b322923.txt">Table of n, a(n) for n = 1..10000</a>
%p A322923 select(isprime,[3*ithprime(p)+4$p=1..120]); # _Muniru A Asiru_, Mar 23 2019
%t A322923 Select[Table[p=Prime[n];3p+4,{n,85}],PrimeQ]
%o A322923 (Magma) [a: p in PrimesUpTo(600) | IsPrime(a) where a is 3*p+4];
%o A322923 (GAP) P:=Filtered([1..1000],IsPrime);;
%o A322923 a:=Filtered(List(P,i->3*i+4),k->IsPrime(k)); # _Muniru A Asiru_, Mar 23 2019
%o A322923 (PARI) terms(n) = my(x=0, i=0); forprime(p=1, , if(i >= n, break); x=3*p+4; if(ispseudoprime(x), print1(x, ", "); i++))
%o A322923 /* Print initial 50 terms as follows: */
%o A322923 terms(50) \\ _Felix Fröhlich_, Mar 23 2019
%Y A322923 Cf. A023209, A100202, A102851, A142120, A142262, A142817.
%K A322923 nonn,easy
%O A322923 1,1
%A A322923 _Vincenzo Librandi_, Mar 12 2019