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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A368161 a(n) = least perfect power m that is the sum of n consecutive perfect powers, or -1 if m does not exist. 1
1, 25, 441, 100, 169, 289, 121, 2395417249 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
It is conjectured that m always exists.
The present state of knowledge (with ? for unknown entries) is:
1, 25, 441, 100, 169, 289, 121, 2395417249, ?, 15386237159377984, 676, 232324, ?, ?, ?, 64866916, 3721, 3622354596, 279936, ?, ?, 41152225, 29929, 2137444, ?, 11526025, 97969, 9922500, ?, 978626089, ?, 347151424, ?
Known solutions < 10^12 from J. Stauduhar. All others from Tim Peters.
LINKS
J. Stauduhar, 3772 known solutions.
EXAMPLE
128 + 144 + 169 = 441, and 441 is the first perfect power that is the sum of three consecutive perfect powers, so a(3) = 441.
CROSSREFS
Cf. A001597.
Sequence in context: A092430 A018207 A362428 * A264382 A337901 A260854
KEYWORD
sign,more
AUTHOR
J. Stauduhar and Tim Peters, Dec 14 2023
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 15:21 EDT 2024. Contains 375938 sequences. (Running on oeis4.)