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!)
A350270 a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly n ways, or 0 if no such number exists. 2

%I #12 Dec 30 2021 10:49:20

%S 1,1729,5104,4445,4509,4662,5454,6210,9045,11124,14967,17964,22051,

%T 26209,32697,39564,46908,56070,66222,78912,92961,105841,123732,143200,

%U 162801,188154,212220,241614,271405,307448,344016,383607,428624,475273,529830,586664,645120

%N a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly n ways, or 0 if no such number exists.

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>

%e For n = 2: 1729 = 1^3 + 12^3 = 9^3 + 10^3.

%e For n = 3: 5104 = 1^3 + 12^3 + 15^3 = 2^3 + 10^3 + 16^3 = 9^3 + 10^3 + 15^3.

%Y Cf. A000578, A025401, A025419, A025421, A275154, A350241.

%K nonn

%O 1,2

%A _Ilya Gutkovskiy_, Dec 22 2021

%E a(16)-a(27) from _Michael S. Branicky_, Dec 22 2021

%E More terms from _Jinyuan Wang_, Dec 30 2021

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 16 17:53 EDT 2024. Contains 375976 sequences. (Running on oeis4.)