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!)
A374423 a(n) is the smallest number which can be represented as the sum of 3 distinct positive n-th powers in exactly 4 ways, or -1 if no such number exists. 11
10, 161, 13896, 5978882 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(3) = 13896 = 1^3 + 12^3 + 23^3 = 2^3 + 4^3 + 24^3 = 4^3 + 18^3 + 20^3 = 9^3 + 10^3 + 23^3.
a(4) = 5978882 = 3^4 + 40^4 + 43^4 = 8^4 + 37^4 + 45^4 = 15^4 + 32^4 + 47^4 = 23^4 + 25^4 + 48^4.
CROSSREFS
Sequence in context: A034724 A234283 A074703 * A190903 A303486 A064747
KEYWORD
nonn,hard,more
AUTHOR
Ilya Gutkovskiy, Jul 08 2024
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 7 02:56 EDT 2024. Contains 375728 sequences. (Running on oeis4.)