OFFSET
1,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
Christian Elsholtz, Florian Luca, and Stefan Planitzer, Romanov type problems, The Ramanujan Journal 47.2 (2018): 267-289.
MAPLE
q:= proc(n) local k, i;
for k from 0 while 2^(2^k)<n do
for i while 2^(2^k)+2^ithprime(i)<n do
if isprime(n-2^(2^k)-2^ithprime(i)) then return false fi:
od
od; true
end:
select(q, [$1..200])[]; # Alois P. Heinz, Feb 15 2020
MATHEMATICA
q[n_] := Module[{k, i}, For[k = 0 , 2^(2^k) < n, k++, For[i = 1, 2^(2^k) + 2^Prime[i] < n, i++, If[PrimeQ[n - 2^(2^k) - 2^Prime[i]], Return[False]]] ]; True];
Select[Range[200], q] (* Jean-François Alcover, Nov 27 2020, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 15 2020
STATUS
approved