|
| |
|
|
A341891
|
|
Numbers that are the sum of five fourth powers in nine or more ways.
|
|
7
|
|
|
|
619090, 775714, 954979, 1100579, 1179379, 1186834, 1205539, 1243699, 1357315, 1367539, 1373859, 1422595, 1431234, 1436419, 1511299, 1536019, 1574850, 1699234, 1713859, 1734899, 1801459, 1839874, 1858594, 1863859, 1877394, 1880850, 1882579, 1950355, 1951650
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
David Consiglio, Jr., Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
|
619090 is a term because 619090 = 1^4 + 2^4 + 18^4 + 22^4 + 23^4 = 1^4 + 3^4 + 4^4 + 8^4 + 28^4 = 1^4 + 11^4 + 14^4 + 22^4 + 24^4 = 2^4 + 2^4 + 8^4 + 17^4 + 27^4 = 2^4 + 13^4 + 13^4 + 18^4 + 26^4 = 3^4 + 6^4 + 12^4 + 16^4 + 27^4 = 4^4 + 12^4 + 14^4 + 23^4 + 23^4 = 9^4 + 12^4 + 16^4 + 21^4 + 24^4 = 14^4 + 16^4 + 18^4 + 19^4 + 23^4.
|
|
|
PROG
|
(Python)
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, 1000)]
for pos in cwr(power_terms, 5):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 9])
for x in range(len(rets)):
print(rets[x])
|
|
|
CROSSREFS
|
Cf. A341892, A341897, A344926, A344944, A345185, A345566.
Sequence in context: A254802 A254809 A253818 * A341892 A236064 A204052
Adjacent sequences: A341888 A341889 A341890 * A341892 A341893 A341894
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
David Consiglio, Jr., Jun 04 2021
|
|
|
STATUS
|
approved
|
| |
|
|
