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!)
A345523 Numbers that are the sum of seven cubes in five or more ways. 8

%I #7 Aug 05 2021 15:22:25

%S 627,768,838,845,857,864,874,881,894,900,920,937,950,955,962,969,976,

%T 981,983,990,1002,1009,1011,1016,1027,1046,1053,1054,1060,1061,1063,

%U 1072,1079,1089,1096,1098,1102,1105,1107,1109,1115,1117,1121,1124,1128,1133

%N Numbers that are the sum of seven cubes in five or more ways.

%H Sean A. Irvine, <a href="/A345523/b345523.txt">Table of n, a(n) for n = 1..10000</a>

%e 768 is a term because 768 = 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 8^3 = 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 4^3 + 7^3 = 1^3 + 1^3 + 2^3 + 2^3 + 3^3 + 6^3 + 6^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 5^3 + 7^3 = 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3 + 6^3.

%o (Python)

%o from itertools import combinations_with_replacement as cwr

%o from collections import defaultdict

%o keep = defaultdict(lambda: 0)

%o power_terms = [x**3 for x in range(1, 1000)]

%o for pos in cwr(power_terms, 7):

%o tot = sum(pos)

%o keep[tot] += 1

%o rets = sorted([k for k, v in keep.items() if v >= 5])

%o for x in range(len(rets)):

%o print(rets[x])

%Y Cf. A345482, A345514, A345522, A345524, A345535, A345571, A345777.

%K nonn

%O 1,1

%A _David Consiglio, Jr._, Jun 20 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 April 23 13:11 EDT 2024. Contains 371913 sequences. (Running on oeis4.)