OFFSET
1,1
COMMENTS
Suggested by a Goldbach-type conjecture.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = p^2 + q, p and q primes.
EXAMPLE
7=2^2+3
MAPLE
G := proc(n::posint) local p, q; p := 2; while p<=n-2 do q := n-p^2; if type(q, posint) then if isprime(q) then return(true, p, q); end if; end if; p := nextprime(p); end do; return(false); end:
MATHEMATICA
Take[ Union[ Flatten[ Table[ Prime[i] + Prime[j]^2, {i, 1, 30}, {j, 1, 5}]]], 70]
PROG
(PARI) is(n)=if(n%2, isprime(n-4) || isprimepower(n-2)==2, forprime(q=3, sqrtint(n), if(isprime(n-q^2), return(1))); n==6) \\ Charles R Greathouse IV, Nov 01 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Pilar Guerra Cardenas (pilarguerracardenas(AT)hotmail.com), Mar 03 2003
EXTENSIONS
More terms from Robert G. Wilson v, Mar 05 2003
STATUS
approved