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 A138837 #33 Dec 19 2016 13:25:29
%S A138837 2,5,11,13,17,19,23,29,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,
%T A138837 103,107,109,113,131,137,139,149,151,157,163,167,173,179,181,191,193,
%U A138837 197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283
%N A138837 Non-Mersenne primes: A000040 \ A000668.
%C A138837 Primes that are not Mersenne primes A000668.
%C A138837 Pandigital primes in base 2. (Pandigital interpreted as including all digits, not necessarily only once each.) - _Franklin T. Adams-Watters_, May 11 2011
%C A138837 Primes whose sum of divisors is not a power of 2. - _Omar E. Pol_, Dec 19 2016
%H A138837 Vincenzo Librandi, <a href="/A138837/b138837.txt">Table of n, a(n) for n = 1..1000</a>
%H A138837 Microsoft Ltd., <a href="http://www.primechallenge.org/">The Prime Challenge</a>, Dec. 2013
%H A138837 OEIS wiki, <a href="https://oeis.org/wiki/Pandigital_primes">Pandigital primes</a>.
%F A138837 A138837 = A000040 \ A000668. - _M. F. Hasler_, Feb 09 2014
%t A138837 max = 300; Complement[Prime[Range[PrimePi[max]]], 2^Range[Ceiling[Log[2, max]]] - 1] (* _Alonso del Arte_, Dec 30 2013 *)
%o A138837 (PARI) is_A138837(n)={isprime(n)&&1<<valuation(n+1,2)!=n+1} \\ _M. F. Hasler_, Feb 05 2014
%Y A138837 Primes in A133398.
%Y A138837 Cf. A000040, A000203, A000668, A155151.
%K A138837 easy,nonn
%O A138837 1,1
%A A138837 _Omar E. Pol_, Apr 03 2008
%E A138837 New name from _Omar E. Pol_, Jan 02 2014