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!)
A003398 Numbers that are the sum of 9 positive 9th powers. 32

%I #19 Dec 01 2020 14:34:22

%S 9,520,1031,1542,2053,2564,3075,3586,4097,4608,19691,20202,20713,

%T 21224,21735,22246,22757,23268,23779,39373,39884,40395,40906,41417,

%U 41928,42439,42950,59055,59566,60077,60588,61099,61610,62121,78737,79248,79759,80270,80781,81292,98419

%N Numbers that are the sum of 9 positive 9th powers.

%H David A. Corneth, <a href="/A003398/b003398.txt">Table of n, a(n) for n = 1..10000</a>

%e From _David A. Corneth_, Aug 02 2020: (Start)

%e 26015282 is in the sequence as 26015282 = 1^9 + 1^9 + 1^9 + 2^9 + 5^9 + 5^9 + 5^9 + 6^9 + 6^9.

%e 56248367 is in the sequence as 56248367 = 2^9 + 5^9 + 5^9 + 5^9 + 6^9 + 6^9 + 6^9 + 6^9 + 6^9.

%e 84613980 is in the sequence as 84613980 = 1^9 + 1^9 + 1^9 + 1^9 + 2^9 + 5^9 + 5^9 + 7^9 + 7^9. (End)

%t M = 395235037; m = M^(1/9) // Ceiling; Reap[

%t For[b = a, b <= m, b++, For[c = b, c <= m, c++, For[d = c, d <= m, d++,

%t For[e = d, e <= m, e++, For[f = e, f <= m, f++, For[g = f, g <= m, g++,

%t For[h = g, h <= m, h++, For[i = h, i <= m, i++,

%t s = a^9 + b^9 + c^9 + d^9 + e^9 + f^9 + g^9 + h^9 + i^9;

%t If[s <= M, Sow[s]]]]]]]]]]]][[2, 1]] // Union (* _Jean-François Alcover_, Dec 01 2020 *)

%Y Cf. A001017 (9th powers).

%Y Column k=9 of A336725.

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)