The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A253681 Integer squares c^2 that are equal to the sum of an odd number M of consecutive cubed integers b^3 + (b+1)^3 + ... + (b+M-1)^3 = c^2 starting at b(n) (A253679). 7
 41616, 8643600, 265559616, 3359361600, 25300083600, 135426944016, 568998662400, 1995144950016, 6080268272400, 16566690848400, 41192058954816, 94910460840000, 205045101804816, 419208426176400, 817072496870400, 1527363954902016, 2751797699456400, 4798055269856016 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Numbers c(n) such that b^3 + (b+1)^3 + ... + (b+M-1)^3 = c^2 has nontrivial solutions over the integers for M being an odd positive integer. To every odd positive integer M corresponds a sum of M consecutive cubed integers starting at b^3 having at least one nontrivial solution. For n>=1, M(n)=(2n+1) (A005408), b(n) = M^3 - (3M-1)/2 = (2n+1)^3 - (3n+1) (A253679), c(n) = M*(M^2-1)*(2M^2-1)/2 = 2n*(n+1)*(2n+1)*(8n*(n+1)+1) (A253680) and this sequence a(n) = c(n)^2. The trivial solutions with M < 1 and b < 2 are not considered here. Stroeker stated that all odd values of M yield a solution to b^3 + (b+1)^3 + ... + (b+M-1)^3 = c^2. This was further demonstrated by Pletser. LINKS Vladimir Pletser, Table of n, a(n) for n = 1..50000 Vladimir Pletser, File Triplets (M,b,c) for M=(2n+1) Vladimir Pletser, General solutions of sums of consecutive cubed integers equal to squared integers, arXiv:1501.06098 [math.NT], 2015. R. J. Stroeker, On the sum of consecutive cubes being a perfect square, Compositio Mathematica, 97 no. 1-2 (1995), pp. 295-307. Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1). FORMULA a(n) = (2n(n+1)*(2n+1)*(8n*(n+1)+1))^2. G.f.: -144*x*(289*x^8 + 56846*x^7 + 1199784*x^6 + 6296786*x^5 + 10697390*x^4 + 6296786*x^3 + 1199784*x^2 + 56846*x + 289) / (x -1)^11. - Colin Barker, Jan 09 2015 EXAMPLE For n=1, M(1)=3, b(1)=23, c(1)=204, a(1)=c^2=41616. See "File Triplets (M,b,c) for M=(2n+1)" link, [where in this File, M is the number of term, a the first term and c the square root of the sum]. MAPLE restart: for n from 1 to 50000 do a:=(2*n*(n+1)*(2*n+1)*(8*n*(n+1)+1))^2: print (a); end do: MATHEMATICA f[n_] := (2 n (n + 1) (2 n + 1) (8 n (n + 1) + 1))^2; Array[f, 21] (* Michael De Vlieger, Jan 10 2015 *) PROG (PARI) Vec(-144*x*(289*x^8 +56846*x^7 +1199784*x^6 +6296786*x^5 +10697390*x^4 +6296786*x^3 +1199784*x^2 +56846*x +289) / (x -1)^11 + O(x^100)) \\ Colin Barker, Jan 09 2015 (Magma) [(2*n*(n+1)*(2*n+1)*(8*n*(n+1)+1))^2: n in [1..20]]; // Vincenzo Librandi, Feb 19 2015 CROSSREFS Cf. A116108, A116145, A126200, A126203, A163392, A163393, A253679, A253680. Sequence in context: A236482 A163392 A262801 * A178800 A031669 A028239 Adjacent sequences: A253678 A253679 A253680 * A253682 A253683 A253684 KEYWORD nonn,easy AUTHOR Vladimir Pletser, Jan 08 2015 STATUS approved

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

Last modified June 19 15:28 EDT 2024. Contains 373503 sequences. (Running on oeis4.)