The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118954 Numbers that cannot be written as 2^k + prime. 7
 1, 2, 16, 22, 26, 28, 36, 40, 46, 50, 52, 56, 58, 64, 70, 76, 78, 82, 86, 88, 92, 94, 96, 100, 106, 112, 116, 118, 120, 122, 124, 126, 127, 134, 136, 142, 144, 146, 148, 149, 154, 156, 160, 162, 166, 170, 172, 176, 178, 184, 186, 188, 190, 196, 202, 204, 206, 208 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A109925(a(n)) = 0. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 Roger Crocker, A theorem concerning prime numbers, Mathematics Magazine 34:6 (1961), pp. 316+344. P. Erdős, On integers of the form 2^k + p and some related problems, Summa Brasil. Math. 2 (1950), 113-123. N. P. Romanoff, Über einige Sätze der additiven Zahlentheorie, Math. Ann. 57 (1934), pp. 668-678. J. G. van der Corput, On de Polignac’s conjecture, Simon Stevin 27 (1950), pp. 99-105. Cited in MR 35298. FORMULA n < a(n) < kn for some k < 2 and all large enough n, see Romanoff and either Erdős or van der Corput. - Charles R Greathouse IV, Sep 01 2015 PROG (Haskell) a118954 n = a118954_list !! (n-1) a118954_list = filter f [1..] where    f x = all (== 0) \$ map (a010051 . (x -)) \$ takeWhile (< x) a000079_list -- Reinhard Zumkeller, Jan 03 2014 (PARI) is(n)=my(k=1); while(k

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 15:11 EST 2020. Contains 338683 sequences. (Running on oeis4.)