login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218214 Number of primes up to 10^n representable as sums of consecutive squares. 1
1, 5, 18, 48, 117, 304, 823, 2224, 6113, 16974, 48614, 139349 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

a(n) = A218208(n) + A218210(n) + A218212(n); n < 13.

LINKS

Table of n, a(n) for n=1..12.

FORMULA

a(n) = sum(A218213(k),k=1..n)

EXAMPLE

a(1) = 1 because only one prime less than 10 can be represented as a sum of consecutive squares, namely 5 = 1^2 + 2^2.

a(2) = 5 because there are five primes less than 100 representable as a sum of consecutive squares: the aforementioned 5, as well as 13 = 2^2 + 3^2, 29 = 2^2 + 3^2 + 4^2, 41 = 4^2 + 5^2 and 61 = 5^2 + 6^2.

MATHEMATICA

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]}]; Accumulate[t] (* T. D. Noe, Oct 23 2012 *)

CROSSREFS

Cf. A027861, A027862, A027863, A027864, A027866, A027867, A163251, A174069, A218208, A218210, A218212, A218213.

Sequence in context: A217866 A256539 A109363 * A146213 A176145 A270978

Adjacent sequences:  A218211 A218212 A218213 * A218215 A218216 A218217

KEYWORD

nonn,base

AUTHOR

Martin Renner, Oct 23 2012

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 12 01:08 EST 2017. Contains 295936 sequences.