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 A156153 #11 Feb 24 2020 04:23:11 %S A156153 5,41,367,9559817,514275529 %N A156153 Primes p such that p == 2 (mod pi(p)) and pi(p) is prime. %F A156153 a(n) = A000040(A156154(n)) = A000040(A000040(A156155(n))). %o A156153 (PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1(p, ", ")); \\ Modified by _Jinyuan Wang_, Feb 22 2020 %Y A156153 Cf. A023144, A156152, A156154, A156155. %K A156153 nonn,hard,more %O A156153 1,1 %A A156153 _M. F. Hasler_, Feb 04 2009