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 A156149 #3 Jul 14 2012 11:32:23 %S A156149 11,71,637319,637327 %N A156149 Primes p such that prime(p)+2 = 0 (mod p), where prime(p)=A000040(p) is the p-th prime. %C A156149 The subsequence of primes in A092044. %F A156149 a(n) = A000720(A156150(n)) = A000040(A156148(n)) %o A156149 (PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( c",")) %Y A156149 Cf. A156154. %K A156149 hard,more,nonn %O A156149 1,1 %A A156149 _M. F. Hasler_, Feb 04 2009