login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218213 Number of n-digit primes representable as sums of consecutive squares. 2

%I #7 Oct 23 2012 21:58:40

%S 1,4,13,30,69,187,519,1401,3889,10861,31640,90735

%N Number of n-digit primes representable as sums of consecutive squares.

%C There are no common representations of two, three or six squares for n < 13, so

%C a(n) = A218207(n) + A218209(n) + A218211(n); n < 13.

%F a(n) = A218214(n) - A218213(n-1).

%t nn = 8; nMax = 10^nn; t = Table[0, {nn}]; Do[k = n; s = 0; While[s = s + k^2; s <= nMax, If[PrimeQ[s], t[[Ceiling[Log[10, s]]]]++]; k++], {n, Sqrt[nMax]}]; t (* _T. D. Noe_, Oct 23 2012 *)

%Y Cf. A027861, A027862, A027863, A027864, A027866, A027867, A218207, A218209, A218211.

%K nonn,base

%O 1,2

%A _Martin Renner_, Oct 23 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 22:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)