cp's OEIS Frontend

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.

A156150 Primes p such that p+2 = 0 (mod pi(p)) and pi(p)=A000720(p) is prime.

This page as a plain text file.
%I A156150 #3 Jul 14 2012 11:32:23
%S A156150 31,353,9559783,9559903
%N A156150 Primes p such that p+2 = 0 (mod pi(p)) and pi(p)=A000720(p) is prime.
%C A156150 A subsequence of A156151.
%F A156150 a(n) = A000040(A156149(n))
%o A156150 (PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( p","))
%Y A156150 Cf. A156153.
%K A156150 hard,more,nonn
%O A156150 1,1
%A A156150 _M. F. Hasler_, Feb 04 2009