This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A368161 #31 Feb 25 2024 22:49:48 %S A368161 1,25,441,100,169,289,121,2395417249 %N A368161 a(n) = least perfect power m that is the sum of n consecutive perfect powers, or -1 if m does not exist. %C A368161 It is conjectured that m always exists. %C A368161 The present state of knowledge (with ? for unknown entries) is: %C A368161 1, 25, 441, 100, 169, 289, 121, 2395417249, ?, 15386237159377984, 676, 232324, ?, ?, ?, 64866916, 3721, 3622354596, 279936, ?, ?, 41152225, 29929, 2137444, ?, 11526025, 97969, 9922500, ?, 978626089, ?, 347151424, ? %C A368161 Known solutions < 10^12 from _J. Stauduhar_. All others from _Tim Peters_. %H A368161 J. Stauduhar, <a href="/A368161/a368161.txt">3772 known solutions</a>. %e A368161 128 + 144 + 169 = 441, and 441 is the first perfect power that is the sum of three consecutive perfect powers, so a(3) = 441. %Y A368161 Cf. A001597. %K A368161 sign,more %O A368161 1,2 %A A368161 _J. Stauduhar_ and _Tim Peters_, Dec 14 2023