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 A146764 #8 Jun 14 2017 01:10:08 %S A146764 13,61,73,109,151,181,229,241,257,293,307,313,349,353,373,397,409,487, %T A146764 509,557,571,577,601,613,643,653,661,709,727,733,739,751,761,773,811, %U A146764 823,937,941,977 %N A146764 Primes not in A075255. %C A146764 It has been asked whether A146071 contains all primes. The answer is no: since A075255(n) > n/2-2 for nonprime n, any prime p that did not appear until the rank 2(p+2) is not in A075255. This is a sufficient condition for not being in A146071, but unless proved otherwise, there may be primes in A075255, i.e., not listed here, which nevertheless do not appear in A146071. %o A146764 (PARI) A146764( END=999 )=local( n=1, t=0, k); forprime( p=1,END, while( n<2*(p+2), isprime( k=A075255(n++)) || next; t=bitor(1<<primepi(k),t)); bittest(t,primepi(p)) || print1(p",")) %Y A146764 Cf. A075255, A146071, A145834. %K A146764 easy,nonn %O A146764 1,1 %A A146764 _M. F. Hasler_, Nov 04 2008