A001032 Numbers k such that sum of squares of k consecutive integers >= 1 is a square.
1, 2, 11, 23, 24, 26, 33, 47, 49, 50, 59, 73, 74, 88, 96, 97, 107, 121, 122, 146, 169, 177, 184, 191, 193, 194, 218, 239, 241, 242, 249, 289, 297, 299, 311, 312, 313, 337, 338, 347, 352, 361, 362, 376, 383, 393, 407, 409, 431, 443, 457, 458, 479, 481, 491, 506
Offset: 1
Examples
3^2 + 4^2 = 5^2, with two consecutive terms, so 2 is in the sequence. Sum_{m=18..28} m^2 = 77^2, with eleven consecutive terms, so 11 is in the sequence and A007475(3) = 18. - _Bernard Schott_, Jan 03 2022
References
- S. Dinh, The Hard Mathematical Olympiad Problems And Their Solutions, AuthorHouse, 2011, Problem 6 of the Irish Mathematical Olympiad 1990 (in fact, it is 1991), page 96.
- W. Ljunggren, New solution of a problem proposed by E. Lucas, Norsk Mat. Tid. 34 (1952), 65-72.
- N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- Christopher E. Thompson, Table of n, a(n) for n = 1..10438 (up to 250000, extends first 128 terms computed by T. D. Noe).
- U. Alfred, Consecutive integers whose sum of squares is a perfect square, Math. Mag., 37 (1964), 19-32.
- Laurent Beeckmans, Squares expressible as sum of consecutive squares, Amer. Math. Monthly, 101 (1994), 437-442.
- Kevin S. Brown, Sum of Consecutive Nth Powers Equals an Nth Power
- Anji Dong, Katerina Saettone, Kendra Song, and Alexandru Zaharescu, An Equidistribution Result for Differences Associated with Square Pyramidal Numbers, arXiv:2412.10097 [math.NT], 2024. See p. 1.
- Moshe Laub, Squares Expressible as a Sum of n Consecutive Squares, Advanced Problem 6552, Amer. Math. Monthly 97 (1990), 622-625.
- Stanton Philipp, Note on consecutive integers whose sum of squares is a perfect square, Math. Mag., 37 (1964), 218-220.
- Vladimir Pletser, Congruence conditions on the number of terms in sums of consecutive squared integers equal to squared integers, arXiv:1409.7969 [math.NT], 2014.
- Vladimir Pletser, Finding all squared integers expressible as the sum of consecutive squared integers using generalized Pell equation solutions with Chebyshev polynomials, arXiv preprint arXiv:1409.7972 [math.NT], 2014.
- John Scholes, 4th Irish Mathematical Olympiad 1991, Problem B1.
- G. N. Watson, The problem of the square pyramid, Messenger of Mathematics 48 (1918), pp. 1-22.
- Eric Weisstein's World of Mathematics, Cannonball Problem
- Index to sequences related to Olympiads.
- Index entries for sequences related to sums of squares
Crossrefs
Programs
-
Mathematica
(* An empirical recomputation, assuming Ralf Stephan's conjecture *) nmax = 600; min[](* minimum start number *) = 1; max[](* maximum start number *) = 10^5; min[457(* the first not-so-easy term *)] = 10^7; min[577] = 10^5; min[587] = 10^7; max[457] = max[577] = max[587] = Infinity; okQ[n_ /; ! MemberQ[{0, 1, 2, 9, 11, 16, 23}, Mod[n, 24]]] = False; okQ[n_] := For[m = min[n], m < max[n], m++, If[IntegerQ[ r = Sqrt[1/6*n*(1 + 6*m^2 + 6*m*(n - 1) - 3*n + 2*n^2)]], Return[True]]]; nmr = Reap[k = 1; Do[If[okQ[n] === True, Print["a(", k, ") = ", n, ", start nb = A007475(", k, ") = ", m, ", sqrt(sum) = A076215(", k, ") = ", r]; k++; Sow[{n, m, r}]], {n, 1, nmax}]][[2, 1]]; A001032 = nmr[[All, 1]]; A007475 = nmr[[All, 2]]; A076215 = nmr[[All, 3]] (* Jean-François Alcover, Sep 09 2013 *)
-
PARI
is(n,L=max(999,n^5\2e5),s=norml2([1..n-1]))={bittest(8456711,n%24) && for(x=n,L,issquare(s+=(2*x-n)*n)&&return(x))} \\ Returns the smallest "ending number" x (such that (x-n+1)^2+...+x^2 is a square) if n is in the sequence, otherwise zero. - M. F. Hasler, Feb 02 2016
Extensions
Corrected by T. D. Noe, Aug 25 2004
Offset changed to 1 by N. J. A. Sloane, Jun 2008
Additional terms up to 30000 added to b-file by Christopher E. Thompson, Jun 10 2016
Additional terms up to 250000 added to b-file by Christopher E. Thompson, Feb 20 2018
Comments