[go: up one dir, main page]

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!)
A374227 a(n) is the smallest number which can be represented as the sum of three distinct positive n-th powers in exactly n ways, or -1 if no such number exists. 4
6, 62, 5104, 5978882 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(3) = 5104 = 1^3 + 12^3 + 15^3 = 2^3 + 10^3 + 16^3 = 9^3 + 10^3 + 15^3.
CROSSREFS
Sequence in context: A347016 A222079 A158987 * A339239 A055005 A027811
KEYWORD
nonn,hard,more
AUTHOR
Ilya Gutkovskiy, Jul 01 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 August 30 11:14 EDT 2024. Contains 375543 sequences. (Running on oeis4.)