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!)
A345087 Numbers that are the sum of three third powers in eight or more ways. 8

%I #8 Aug 05 2021 15:29:21

%S 2562624,5618250,6525000,6755328,7374375,12742920,13581352,14027112,

%T 14288373,14926248,16819704,18443160,20168784,20500992,22783032,

%U 23113728,25305048,26936064,27131840,29515968,30205440,32835375,34012224,38269440,39317832,39339000

%N Numbers that are the sum of three third powers in eight or more ways.

%H David Consiglio, Jr., <a href="/A345087/b345087.txt">Table of n, a(n) for n = 1..100</a>

%e 2562624 is a term because 2562624 = 7^3 + 35^3 + 135^3 = 7^3 + 63^3 + 131^3 = 11^3 + 99^3 + 115^3 = 16^3 + 45^3 + 134^3 = 29^3 + 102^3 + 112^3 = 35^3 + 59^3 + 131^3 = 50^3 + 84^3 + 121^3 = 68^3 + 71^3 + 122^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, 3):

%o tot = sum(pos)

%o keep[tot] += 1

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

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

%o print(rets[x])

%Y Cf. A025336, A344737, A345086, A345088, A345119, A345152.

%K nonn

%O 1,1

%A _David Consiglio, Jr._, Jun 07 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 June 30 13:28 EDT 2024. Contains 373871 sequences. (Running on oeis4.)