A116108 -id:A116108 - cp's OEIS frontend

A218979 Numbers n such that some sum of n consecutive positive cubes is a square.

1, 3, 5, 7, 8, 9, 11, 12, 13, 15, 17, 18, 19, 21, 23, 25, 27, 28, 29, 31, 32, 33, 35, 37, 39, 40, 41, 42, 43, 45, 47, 48, 49, 50, 51, 53, 54, 55, 57, 59, 60, 61, 63, 64, 65, 67, 69, 71, 72, 73, 75, 76, 77, 79, 81, 82, 83, 85, 87, 89, 91, 92, 93, 94, 95, 97, 98, 99

Offset: 1

Michel Marcus, Nov 08 2012

nonn

The trivial solutions with x = 0 and x = 1 are not considered here.
Numbers n such that x^3 + (x+1)^3 + ... + (x+n-1)^3 = y^2 has nontrivial solutions over the integers.
The nontrivial solutions are found by solving Y^2 = X^3 + d(n)*X with d(n) = n^2*(n^2-1)/4 (A006011), Y = n*y and X = n*x + (1/2)*n*(n-1). [Corrected by Derek Orr, Aug 30 2014]
x^3 + (x+1)^3 + ... + (x+n-1)^3 = y^2 can also be written as y^2 = n(x + (n-1)/2)(n(x + (n-1)/2) + x(x-1)). - Vladimir Pletser, Aug 30 2014
There are 892 triples (n,x,y), with n and x less than 10^5 (1 < n,x < 10^5), which are nontrivial solutions of x^3 + (x+1)^3 + ... + (x+n-1)^3 = y^2 (note that (n,x,y) corresponds to (M,a,c) in A253679, A253680, A253681, A253707, A253708, A253709, A253724, A253725). - Vladimir Pletser, Jan 10 2015

			See "Examples of triples" link.

Michel Marcus, Examples of triples up to n=50
Vladimir Pletser, Triplets (n, x, y) with n,x less than 10^5
Vladimir Pletser, Number of terms, first term and square root of sums of consecutive cubed integers equal to integer squares, Research Gate, 2015.
Vladimir Pletser, Fundamental solutions of the Pell equation X^2-(sigma^4-delta^4)Y^2=delta^4 for the first 45 solutions of the sums of consecutive cubed integers equalling integer squares, Research Gate, 2015. See Reference 19.
V. 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.

Cf. A116108, A116145, A126200, A126203, A163392, A163393, A253679, A253680, A253681, A253707, A253708, A253709.

a(n)=for(x=2,10^7, /* note this limit only generates the terms in the data section */ X = n*x + (1/2)*n*(n-1); d=n^2*(n^2-1)/4;if(issquare(X^3+d*X),return(x)))
n=1;while(n<100,if(a(n),print1(n,", "));n++) \\ Derek Orr, Aug 30 2014

Name changed, a(1) = 1 prepended and a(39)-a(68) from Derek Orr, Aug 30 2014

More terms for 50Vladimir Pletser, Jan 10 2015

A309071 Complete list of solutions to y^2 = x^3 + 20*x; sequence gives x values.

Original entry on oeis.org

0, 4, 5, 720

Offset: 1

Seiichi Manyama, Jul 10 2019

(x,y) = (0,0) is this solution. Consider x > 0. If x is square, x^2 + 20 is square and we get (x,y) = (4,12). If x is not square, x = i^2*j where j is squarefree. j | x^2 + 20, so j is 2,5 or 10. If j = 2 or 10, there is no such (x,y). If j = 5, (y/5)^2 = i^2*(5*i^4 + 4). So 5*i^4 + 4 = k^2. That is k^2 - 5*i^4 = 4. i^2 is a square Fibonacci number. i^2 = 1 or 144, so x = 5 or 720.

			  0^3 + 20*  0 =         0 =     0^2.
  4^3 + 20*  4 =       144 =    12^2.
  5^3 + 20*  5 =       225 =    15^2.
720^3 + 20*720 = 373262400 = 19320^2.

Cf. A029728, A116108, A126203.

for(k=0, 1e5, if(issquare(k*(k^2+20)), print1(k", ")))

[i[0] for i in EllipticCurve([20, 0]).integral_points()] # Seiichi Manyama, Aug 25 2019

cp's OEIS Frontend

A218979 Numbers n such that some sum of n consecutive positive cubes is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions