|
Search: id:A065739
|
|
|
| A065739 |
|
Largest square <= sum of first n squares. |
|
+0 1
|
|
| 1, 4, 9, 25, 49, 81, 121, 196, 256, 361, 484, 625, 784, 961, 1225, 1444, 1764, 2025, 2401, 2809, 3249, 3721, 4225, 4900, 5476, 6084, 6889, 7569, 8464, 9409, 10404, 11236, 12321, 13456, 14884, 16129, 17424, 18769, 20449, 21904, 23716, 25281
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
a(n)=A048760[A000330(n)]
|
|
PROGRAM
|
(PARI) { s=0; for (n=1, 1000, s+=n^2; a=sqrtint(s)^2; write("b065739.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 29 2009]
|
|
CROSSREFS
|
Cf. A048760, A000330, A065730-A065741
Sequence in context: A063482 A069557 A130283 this_sequence A053704 A158144 A158145
Adjacent sequences: A065736 A065737 A065738 this_sequence A065740 A065741 A065742
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 15 2001
|
|
|
Search completed in 0.002 seconds
|