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 A156154 #5 Dec 28 2022 15:08:58 %S A156154 3,13,73,637321,27067133 %N A156154 Primes p such that prime(p)=2 (mod p), where prime(p)=A000040(p) is the p-th prime. %F A156154 a(n) = A000040(A156155(n)) ; A156154 = intersection of A000040 and A023144. %t A156154 Select[Prime[Range[17*10^5]],Mod[Prime[#],#]==2&] (* _Harvey P. Dale_, Dec 28 2022 *) %o A156154 (PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1( c",")) %Y A156154 Cf. A156153. %K A156154 hard,more,nonn %O A156154 1,1 %A A156154 _M. F. Hasler_, Feb 04 2009