OFFSET
1,2
COMMENTS
LINKS
Sean A. Irvine, Table of n, a(n) for n = 1..50
MAPLE
primesums_primes_search(16); primesums_primes_search := (upto_n) -> primesums_primes_search_aux([], 1, upto_n); primesums_primes_search_aux := proc(a, n, upto_n) local i, p, t; if(n > upto_n) then RETURN(a); fi; p := ithprime(n); for i from (2^(n-1)) to ((2^n)-1) do t := bin_prime_sum(i); if(t = p) then print([op(a), i]); RETURN(primesums_primes_search_aux([op(a), i], n+1, upto_n)); fi; od; RETURN([op(a), `and no more found`]); end;
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 05 2001
EXTENSIONS
More terms from Naohiro Nomoto, Sep 12 2001
More terms from Larry Reeves (larryr(AT)acm.org), Nov 20 2003
STATUS
approved