|
|
A218044
|
|
Numbers of the form 2^k + prime, with k > 0.
|
|
4
|
|
|
4, 5, 6, 7, 9, 10, 11, 13, 15, 17, 18, 19, 21, 23, 25, 27, 29, 31, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 66, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A039669 is included in this sequence.
|
|
LINKS
|
Yong-Gao Chena and Xue-Gong Sunb, On Romanoff's constant, Journal of Number Theory, Volume 106, Issue 2, June 2004, Pages 275-284.
Christian Elsholtz, Florian Luca, and Stefan Planitzer, Romanov type problems, The Ramanujan Journal 47.2 (2018): 267-289.
|
|
EXAMPLE
|
5 = 3 + 2 that is, a prime and a power of 2.
|
|
MAPLE
|
q:= n-> ormap(isprime, [seq(n-2^k, k=1..ilog2(n))]):
|
|
MATHEMATICA
|
nn = 119; ps = Prime[Range[PrimePi[nn]]]; p2 = 2^Range[Log[2, nn]]; u = {}; Do[u = Union[u, ps + p2[[i]]], {i, Length[p2]}]; Select[u, # <= nn &] (* T. D. Noe, Oct 19 2012 *)
|
|
PROG
|
(PARI) isok(n) = {forprime(p=2, n, my(d = n - p); if ((d==2) || (ispower(d, , &k) && (k==2)), return(1)); ); 0; } \\ Michel Marcus, Apr 18 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|