login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A064013
Sum of first n^2 odd primes (=S) is divisible by n and S/n = n mod 2.
2
1, 35, 215, 225, 398, 2097, 5205, 7452, 22359, 98176, 169653
OFFSET
1,2
COMMENTS
A necessary condition for the existence of a magic square consisting of the first n^2 odd primes.
a(12) > 500000. - Donovan Johnson
EXAMPLE
a(2)=35 since 3+5+ ... +9941 = 5706505 = 35*163043 and 163043 = 35 mod 2.
PROG
(PARI) s=0; t=0; u=1; forprime(x=3, 2500000, s=s+x; t=t+1; if(t==u*u, if(s%u==0&(s\u)%2==u%2, print(u), ); u=u+1, ))
CROSSREFS
Sequence in context: A007329 A345655 A101628 * A240137 A020262 A224104
KEYWORD
nonn,hard
AUTHOR
H. K. Gottlob Maier (1korrago(AT)freenet.de), Sep 07, 2001
EXTENSIONS
a(10)-a(11) from Donovan Johnson, Nov 30 2010
STATUS
approved