|
Search: id:A065611
|
|
|
| A065611 |
|
Least k such that n^2 + Sum (from 1 to k) m^2 is a perfect square. |
|
+0
2
|
|
| 1, 35721, 9, 64, 150700176, 1521, 1718434116, 3844, 1849, 900, 2209, 474721, 529, 116964, 400, 419845682025, 618399795456, 3600, 187489, 1734149230641, 10816, 1681, 5560164, 2025, 961, 1444, 961, 784, 41209, 21926752125201
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
I.e. n^2 + {1+4+9+16+...+m^2} = a[n] = A065612(n)^2 = A065311(n). a[n] is the smallest square obtained as n^2+[x(x+1)(2x+1)/6] where x = A065610(n).
|
|
EXAMPLE
|
n = 3: a[4] = 64 because n^2+1+4+9+16+25 = 9+(1+4+9+16+25) = 64 = 8.8; n = 4: a[4] = 150700176 because n^2+(1+4+...+767^2) = 150700176 = 12276.12726, where 767 is the length of shortest such consecutive-square sequence which provides[when summed] a new square, namely 12276^2. Often the least solution is rather large. E.g. at n = 93, a[n] = 23850559947150225 which means that 93^2+A000330[415151] = 8649+ [a long square sum] = 154436265^2 = 23850559947150225.
|
|
MATHEMATICA
|
Do[s = n^2; k = 1; While[s = s + k^2; !IntegerQ[ Sqrt[s]], k++ ]; Print[s], {n, 0, 30} ]
|
|
CROSSREFS
|
Cf. A000330, A065610-A065615.
Sequence in context: A085545 A031855 A133282 this_sequence A101252 A133281 A034605
Adjacent sequences: A065608 A065609 A065610 this_sequence A065612 A065613 A065614
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 07 2001
|
|
|
Search completed in 0.002 seconds
|
