login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A253679
Numbers that begin a run of an odd number of consecutive integers whose cubes sum to a square.
8
23, 118, 333, 716, 1315, 2178, 3353, 4888, 6831, 9230, 12133, 15588, 19643, 24346, 29745, 35888, 42823, 50598, 59261, 68860, 79443, 91058, 103753, 117576, 132575, 148798, 166293, 185108, 205291, 226890, 249953, 274528, 300663, 328406, 357805, 388908, 421763, 456418, 492921, 531320, 571663, 613998, 658373, 704836, 753435, 804218, 857233, 912528, 970151, 1030150, 1092573, 1157468
OFFSET
1,1
COMMENTS
Numbers k such that k^3 + (k+1)^3 + ... + (k+M-1)^3 = c^2 has nontrivial solutions over the integers where M is an odd positive integer.
To every odd positive integer M corresponds a sum of M consecutive cubes starting at a(n) having at least one nontrivial solution. For n >= 1, M(n) = (2n+1) (A005408), a(n) = M^3 - (3M-1)/2 = (2n+1)^3 - (3n+1) and c(n) = M*(M^2-1)*(2M^2-1)/2 = 2n*(n+1)*(2n+1)*(8n*(n+1)+1) (A253680).
The trivial solutions with M < 1 and k < 2 are not considered here.
Stroeker stated that all odd values of M yield a solution to k^3 + (k+1)^3 + ... + (k+M-1)^3 = c^2. This was further demonstrated by Pletser.
FORMULA
a(n) = (2n+1)^3 - (3n+1).
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - Colin Barker, Jan 09 2015
G.f.: -x*(x^2-26*x-23) / (x-1)^4. - Colin Barker, Jan 09 2015
EXAMPLE
For n=1, M(n)=3, a(n)=23, c(n)=204.
See "File Triplets (M,a,c) for M=(2n+1)" link.
MAPLE
for n from 1 to 50 do a:=(2*n+1)^3-(3*n+1): print (a); end do:
MATHEMATICA
a253679[n_] := (2 # + 1)^3 - (3 # + 1) & /@ Range@ n; a253679[52] (* Michael De Vlieger, Jan 10 2015 *)
PROG
(PARI) Vec(-x*(x^2-26*x-23)/(x-1)^4 + O(x^100)) \\ Colin Barker, Jan 09 2015
KEYWORD
nonn,easy
AUTHOR
Vladimir Pletser, Jan 08 2015
STATUS
approved