This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
44946 = 7^3 + 12^3 + 35^3
= 9^3 + 17^3 + 34^3
= 11^3 + 24^3 + 31^3
= 16^3 + 17^3 + 33^3
so 44946 is a term.
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**3 for x in range(1,50)]
for pos in cwr(power_terms,3):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k,v in keep.items() if v >= 4])
for x in range(len(rets)):
print(rets[x])
5616 = 1^3 + 8^3 + 12^3 + 15^3
= 2^3 + 8^3 + 10^3 + 16^3
= 4^3 + 4^3 + 14^3 + 14^3
= 4^3 + 5^3 + 11^3 + 16^3
= 8^3 + 9^3 + 10^3 + 15^3
so 5616 is a term.
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x ** 3 for x in range(1, 50)]
for pos in cwr(power_terms, 4):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 5])
for x in range(len(rets)):
print(rets[x], end=", ")
1296378 is a term because 1296378 = 3^3 + 75^3 + 94^3 = 8^3 + 32^3 + 107^3 = 20^3 + 76^3 + 93^3 = 30^3 + 58^3 + 101^3 = 32^3 + 80^3 + 89^3 = 59^3 + 74^3 + 86^3.
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**3 for x in range(1, 1000)]
for pos in cwr(power_terms, 3):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 6])
for x in range(len(rets)):
print(rets[x])
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**3 for x in range(1,50)]
for pos in cwr(power_terms,3):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k,v in keep.items() if v == 5])
for x in range(len(rets)):
print(rets[x])
292965218 is a member of this sequence because 292965218 = 2^4 + 109^4 + 111^4 = 21^4 + 98^4 + 119^4 = 27^4 + 94^4 + 121^4 = 34^4 + 89^4 + 123^4 = 49^4 + 77^4 + 126^4 = 61^4 + 66^4 + 127^4 (actually has 6 representations, so is a member of this sequence but not of A344365). 1234349298 is a member of this sequence because 1234349298 = 7^4 + 154^4 + 161^4 = 26^4 + 143^4 + 169^4 = 61^4 + 118^4 + 179^4 = 74^4 + 107^4 + 181^4 = 91^4 + 91^4 + 182^4.
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**4 for x in range(1, 500)]
for pos in cwr(power_terms, 3):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 5])
for x in range(len(rets)):
print(rets[x])
a(1) = 36 = 1^3 + 2^3 + 3^3. a(2) = 1009 = 1^3 + 2^3 + 10^3 = 4^3 + 6^3 + 9^3. a(3) = 12384 = 1^3 + 6^3 + 23^3 = 2^3 + 12^3 + 22^3 = 15^3 + 16^3 + 17^3.
Monitor[Do[k=1;While[Length@Union@Flatten[p=PowersRepresentations[k,3,3]]!=n*3||Length@p!=n||MemberQ[Flatten@p,0],k++];Print@k,{n,10}],k] (* Giorgos Kalogeropoulos, Sep 03 2021 *)
Comments