OFFSET
1,1
COMMENTS
Conjecture: sequence includes all integers k > 24. See A090460 for the number of essentially different solutions.
It is now known that 25..299 are in the sequence, see the Numberphile 2 link. - Jud McCranie, Jan 11 2018
Every 25 <= k <= 2^20 is in the sequence and (71*25^m-1)/2 is also in the sequence for every m, hence this sequence is infinite, see Mersenneforum link for the proof; we give Hamiltonian cycle for these k values if k >= 32. - Robert Gerbicz, Jan 17 2017
The conjecture has been proved: every k >= 25 is in the sequence, moreover for k >= 32 there is a Hamiltonian cycle; see Mersenneforum topic for a code and deterministic algorithm to find a sequence. - Robert Gerbicz, Jan 21 2018
LINKS
Brady Haran and Matt Parker, The Square-Sum Problem, Numberphile video (2018)
Brady Haran, Matt Parker, and Charlie Turner, The Square-Sum Problem (extra footage) - Numberphile 2 (2018)
HexagonVideos, Numberphile's Square-Sum Problem was solved!, YouTube video, 2023.
Mersenneforum, The Square-Sum problem
EXAMPLE
See A071983.
MAPLE
F:= proc(n)
uses GraphTheory;
local edg, G;
edg:= select(t -> issqr(t[1]+t[2]), {seq(seq({i, j}, i=1..j-1), j=1..n)}) union {seq({i, n+1}, i=1..n)};
G:= Graph(n+1, edg);
IsHamiltonian(G)
end proc:
select(F, [$1..50]); # Robert Israel, Jun 05 2015
MATHEMATICA
Join[{15, 16, 17, 23}, Range[25, 100]] (* Paolo Xausa, May 28 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Dec 01 2003
EXTENSIONS
a(31)-a(69) from Donovan Johnson, Sep 14 2010
STATUS
approved