The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106545 a(n) = n^2 if n^2 is the sum of two primes, otherwise a(n) = 0. 3
 0, 4, 9, 16, 25, 36, 49, 64, 81, 100, 0, 144, 169, 196, 225, 256, 0, 324, 361, 400, 441, 484, 0, 576, 0, 676, 729, 784, 841, 900, 0, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 0, 1600, 0, 1764, 1849, 1936, 0, 2116, 2209, 2304, 2401, 2500, 0, 2704, 0, 2916, 3025 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For odd n, n^2 is odd so the two primes must be opposite in parity. Lesser prime must be 2 and greater prime must be n^2-2. Thus for odd n, n^2 is the sum of two primes iff n^2-2 is prime. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 FORMULA a(n) = n^2 - A106544(n). EXAMPLE a(2) = 2^2 = 4 = 2+2, a(5) = 5^2 = 25 = 23+2 (two primes). a(1) = 0 because the sum of two primes is at least 4 and a(11) = 0 because 11^2 - 2 = 119 = 7*17 is composite. MATHEMATICA stpQ[n_]:=If[OddQ[n], PrimeQ[n^2-2], AnyTrue[n^2-Prime[Range[ PrimePi[ n^2]]], PrimeQ]]; Table[If[stpQ[n], n^2, 0], {n, 60}] (* The program uses the AnyTrue function from Mathematica version 10 *) (* Harvey P. Dale, Jul 21 2018 *) CROSSREFS Cf. A106544-A106548, A106562-A106564, A106571, A106573-A106575, A106577. Sequence in context: A035121 A080151 A292679 * A169920 A093837 A194148 Adjacent sequences:  A106542 A106543 A106544 * A106546 A106547 A106548 KEYWORD easy,nonn AUTHOR Alexandre Wajnberg, May 08 2005 EXTENSIONS Edited and extended by Klaus Brockhaus and Ray Chandler, May 12 2005 STATUS approved

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 May 6 15:15 EDT 2021. Contains 343586 sequences. (Running on oeis4.)