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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130612 Sum of the first 10^n squares. 0
1, 385, 338350, 333833500, 333383335000, 333338333350000, 333333833333500000, 333333383333335000000, 333333338333333350000000, 333333333833333333500000000, 333333333383333333335000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

Sum of the first m squares = m(2m^2+3m+1)/6.

PROG

(PARI) sumsq(n) = for(x=0, n, y=10^x; z=y*(y+1)*(2*y+1)/6; (print1(z", "))) \Trust but verify, brute force sum g1(n) = for(x=0, n, y=sum(j=1, 10^x, j^2); (print1(y", ")))

CROSSREFS

Sequence in context: A204712 A237102 A063390 * A060721 A116316 A213115

Adjacent sequences:  A130609 A130610 A130611 * A130613 A130614 A130615

KEYWORD

nonn

AUTHOR

Cino Hilliard, Jun 18 2007

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified October 25 19:24 EDT 2014. Contains 248557 sequences.