|
Search: id:A130612
|
|
|
| A130612 |
|
Sum of the first 10^n squares. |
|
+0
1
|
|
| 1, 385, 338350, 333833500, 333383335000, 333338333350000, 333333833333500000, 333333383333335000000, 333333338333333350000000, 333333333833333333500000000, 333333333383333333335000000000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Sum of the first m squares = m(2m^2+3m+1)/6.
|
|
PROGRAM
|
(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: A013591 A065110 A063390 this_sequence A060721 A116316 A116329
Adjacent sequences: A130609 A130610 A130611 this_sequence A130613 A130614 A130615
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), Jun 18 2007
|
|
|
Search completed in 0.002 seconds
|
