|
|
A346336
|
|
Numbers that are the sum of nine fifth powers in exactly one way.
|
|
6
|
|
|
9, 40, 71, 102, 133, 164, 195, 226, 251, 257, 282, 288, 313, 344, 375, 406, 437, 468, 493, 499, 524, 555, 586, 617, 648, 679, 710, 735, 766, 797, 828, 859, 890, 921, 977, 1008, 1032, 1039, 1063, 1070, 1094, 1101, 1125, 1132, 1156, 1187, 1218, 1219, 1249, 1250
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Differs from A003354 at term 191 because 4101 = 1^5 + 1^5 + 1^5 + 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5.
|
|
LINKS
|
|
|
EXAMPLE
|
9 is a term because 9 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5.
|
|
PROG
|
(Python)
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**5 for x in range(1, 1000)]
for pos in cwr(power_terms, 9):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v == 1])
for x in range(len(rets)):
print(rets[x])
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|