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.

A065380 Primes of the form p + 2^k, p prime and k >= 0.

This page as a plain text file.
%I A065380 #17 Nov 21 2013 12:47:34
%S A065380 3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,
%T A065380 101,103,107,109,113,131,137,139,151,157,163,167,173,179,181,191,193,
%U A065380 197,199,211,223,227,229,233,239,241,257,263,269,271,277,281,283,293
%N A065380 Primes of the form p + 2^k, p prime and k >= 0.
%H A065380 Reinhard Zumkeller, <a href="/A065380/b065380.txt">Table of n, a(n) for n = 1..10000</a>
%F A065380 A078687(A049084(a(n))) > 0; A091932 is a subsequence. - _Reinhard Zumkeller_, May 07 2006
%e A065380 a(3) = 11 = 3 + 2^3 = 7 + 2^2.
%t A065380 With[{upto=300},Select[Union[Select[Flatten[Outer[Plus,Prime[Range[ PrimePi[upto]]],2^Range[0,Floor[Log[2,upto]]]]],PrimeQ]],#<=upto&]] (* _Harvey P. Dale_, Feb 28 2012 *)
%o A065380 (Haskell)
%o A065380 a065380 n = a065380_list !! (n-1)
%o A065380 a065380_list = filter f a000040_list where
%o A065380    f p = any ((== 1) . a010051 . (p -)) $ takeWhile (<= p) a000079_list
%o A065380 -- _Reinhard Zumkeller_, Nov 24 2011
%Y A065380 Cf. A010051, A000079, A065381, A156695.
%K A065380 nonn
%O A065380 1,1
%A A065380 _Reinhard Zumkeller_, Nov 03 2001