A345584
Numbers that are the sum of eight fourth powers in nine or more ways.
Original entry on oeis.org
15427, 16692, 17348, 17493, 17972, 17987, 18052, 18227, 19267, 19412, 19492, 19507, 19572, 19747, 19748, 20116, 20787, 20852, 21268, 21283, 21333, 21348, 21413, 21443, 21493, 21508, 21523, 21588, 21637, 21652, 21653, 21827, 21877, 21892, 21957, 21972, 22037
Offset: 1
16692 is a term because 16692 = 1^4 + 1^4 + 1^4 + 1^4 + 6^4 + 6^4 + 8^4 + 10^4 = 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 3^4 + 9^4 + 10^4 = 1^4 + 1^4 + 2^4 + 5^4 + 6^4 + 8^4 + 8^4 + 9^4 = 1^4 + 2^4 + 2^4 + 2^4 + 3^4 + 5^4 + 6^4 + 11^4 = 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 7^4 + 8^4 + 10^4 = 1^4 + 3^4 + 4^4 + 4^4 + 6^4 + 7^4 + 7^4 + 10^4 = 1^4 + 3^4 + 5^4 + 6^4 + 7^4 + 8^4 + 8^4 + 8^4 = 2^4 + 2^4 + 4^4 + 4^4 + 5^4 + 7^4 + 9^4 + 9^4 = 2^4 + 3^4 + 4^4 + 5^4 + 6^4 + 6^4 + 9^4 + 9^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, 1000)]
for pos in cwr(power_terms, 8):
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])
A345616
Numbers that are the sum of eight fifth powers in eight or more ways.
Original entry on oeis.org
8625619, 8742208, 9773236, 10036233, 10071050, 12247994, 13180706, 13377868, 13662501, 14584992, 14591744, 14611077, 15251119, 15539667, 16112362, 16374250, 16391025, 16472544, 16588000, 16667851, 17059075, 17216298, 17405300, 17917097, 18107564, 18392902
Offset: 1
8742208 is a term because 8742208 = 1^5 + 1^5 + 2^5 + 3^5 + 5^5 + 7^5 + 15^5 + 24^5 = 1^5 + 1^5 + 9^5 + 9^5 + 11^5 + 17^5 + 18^5 + 22^5 = 1^5 + 3^5 + 7^5 + 12^5 + 12^5 + 13^5 + 17^5 + 23^5 = 2^5 + 5^5 + 6^5 + 7^5 + 15^5 + 15^5 + 15^5 + 23^5 = 3^5 + 3^5 + 7^5 + 9^5 + 12^5 + 12^5 + 21^5 + 21^5 = 4^5 + 4^5 + 4^5 + 11^5 + 11^5 + 12^5 + 21^5 + 21^5 = 4^5 + 4^5 + 8^5 + 8^5 + 9^5 + 15^5 + 17^5 + 23^5 = 8^5 + 13^5 + 14^5 + 14^5 + 14^5 + 16^5 + 19^5 + 20^5 = 10^5 + 12^5 + 12^5 + 13^5 + 16^5 + 16^5 + 19^5 + 20^5.
-
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, 8):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 8])
for x in range(len(rets)):
print(rets[x])
A345626
Numbers that are the sum of nine fifth powers in nine or more ways.
Original entry on oeis.org
1969221, 2596936, 3353186, 3378178, 3923426, 3981447, 4094027, 4096729, 4112329, 4114188, 4129465, 4137209, 4147736, 4157156, 4170112, 4172994, 4254304, 4303773, 4410482, 4475846, 4477936, 4483379, 4485480, 4492410, 4501441, 4510461, 4543232, 4652011, 4691855
Offset: 1
2596936 is a term because 2596936 = 1^5 + 1^5 + 4^5 + 5^5 + 9^5 + 13^5 + 13^5 + 13^5 + 17^5 = 1^5 + 1^5 + 5^5 + 8^5 + 8^5 + 8^5 + 14^5 + 14^5 + 17^5 = 1^5 + 4^5 + 7^5 + 7^5 + 7^5 + 9^5 + 9^5 + 14^5 + 18^5 = 1^5 + 5^5 + 6^5 + 6^5 + 8^5 + 9^5 + 9^5 + 14^5 + 18^5 = 2^5 + 3^5 + 4^5 + 4^5 + 7^5 + 12^5 + 13^5 + 14^5 + 17^5 = 2^5 + 5^5 + 5^5 + 6^5 + 6^5 + 6^5 + 15^5 + 15^5 + 16^5 = 3^5 + 3^5 + 5^5 + 6^5 + 7^5 + 9^5 + 12^5 + 13^5 + 18^5 = 4^5 + 4^5 + 4^5 + 5^5 + 6^5 + 11^5 + 11^5 + 13^5 + 18^5 = 4^5 + 4^5 + 4^5 + 7^5 + 7^5 + 8^5 + 9^5 + 16^5 + 17^5.
-
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 >= 9])
for x in range(len(rets)):
print(rets[x])
A345631
Numbers that are the sum of seven fifth powers in nine or more ways.
Original entry on oeis.org
110276376, 124732805, 127808693, 130298618, 134581976, 188116743, 189642309, 202274051, 202686274, 203343582, 219063107, 230909843, 233137574, 233549568, 234250752, 235438301, 244250335, 251138524, 252277376, 253480833, 254017026, 254380543
Offset: 1
124732805 is a term because 124732805 = 3^5 + 18^5 + 22^5 + 22^5 + 24^5 + 27^5 + 39^5 = 4^5 + 15^5 + 17^5 + 21^5 + 29^5 + 34^5 + 35^5 = 5^5 + 14^5 + 17^5 + 24^5 + 25^5 + 35^5 + 35^5 = 7^5 + 8^5 + 17^5 + 26^5 + 29^5 + 34^5 + 34^5 = 7^5 + 10^5 + 12^5 + 31^5 + 31^5 + 32^5 + 32^5 = 7^5 + 12^5 + 23^5 + 24^5 + 24^5 + 26^5 + 39^5 = 7^5 + 14^5 + 22^5 + 22^5 + 23^5 + 28^5 + 39^5 = 16^5 + 25^5 + 25^5 + 28^5 + 28^5 + 28^5 + 35^5 = 20^5 + 24^5 + 24^5 + 25^5 + 25^5 + 32^5 + 35^5.
-
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, 7):
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])
A346334
Numbers that are the sum of eight fifth powers in exactly nine ways.
Original entry on oeis.org
8742208, 18913169, 19987308, 20135313, 21505583, 21512966, 21563089, 21727552, 22237510, 22256608, 22438990, 22545600, 22686818, 23106589, 23122550, 23189782, 23221517, 23287858, 23346048, 23477344, 23798742, 23847285, 23931325, 24138358, 24385108, 24394139
Offset: 1
8742208 is a term because 8742208 = 1^5 + 1^5 + 2^5 + 3^5 + 5^5 + 7^5 + 15^5 + 24^5 = 4^5 + 4^5 + 8^5 + 8^5 + 9^5 + 15^5 + 17^5 + 23^5 = 1^5 + 3^5 + 7^5 + 12^5 + 12^5 + 13^5 + 17^5 + 23^5 = 2^5 + 5^5 + 6^5 + 7^5 + 15^5 + 15^5 + 15^5 + 23^5 = 1^5 + 1^5 + 9^5 + 9^5 + 11^5 + 17^5 + 18^5 + 22^5 = 3^5 + 3^5 + 7^5 + 9^5 + 12^5 + 12^5 + 21^5 + 21^5 = 4^5 + 4^5 + 4^5 + 11^5 + 11^5 + 12^5 + 21^5 + 21^5 = 10^5 + 12^5 + 12^5 + 13^5 + 16^5 + 16^5 + 19^5 + 20^5 = 8^5 + 13^5 + 14^5 + 14^5 + 14^5 + 16^5 + 19^5 + 20^5.
-
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, 8):
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])
A345618
Numbers that are the sum of eight fifth powers in ten or more ways.
Original entry on oeis.org
15539667, 22932525, 24393600, 24650406, 24952961, 24953742, 25054306, 25142513, 25201550, 25423794, 26001294, 26851552, 27396567, 27988486, 28609075, 29309819, 29558650, 31052406, 31794336, 32223105, 32527286, 32610600, 32807777, 32890541, 32998317, 33015125
Offset: 1
15539667 is a term because 15539667 = 1^5 + 1^5 + 2^5 + 10^5 + 12^5 + 17^5 + 18^5 + 26^5 = 1^5 + 1^5 + 7^5 + 7^5 + 10^5 + 16^5 + 19^5 + 26^5 = 1^5 + 4^5 + 7^5 + 9^5 + 13^5 + 13^5 + 13^5 + 27^5 = 1^5 + 7^5 + 8^5 + 8^5 + 8^5 + 14^5 + 14^5 + 27^5 = 2^5 + 2^5 + 3^5 + 8^5 + 9^5 + 16^5 + 23^5 + 24^5 = 3^5 + 5^5 + 10^5 + 19^5 + 19^5 + 20^5 + 20^5 + 21^5 = 3^5 + 10^5 + 12^5 + 12^5 + 18^5 + 18^5 + 20^5 + 24^5 = 4^5 + 11^5 + 13^5 + 13^5 + 15^5 + 15^5 + 22^5 + 24^5 = 5^5 + 6^5 + 13^5 + 15^5 + 15^5 + 19^5 + 20^5 + 24^5 = 6^5 + 9^5 + 11^5 + 11^5 + 15^5 + 21^5 + 22^5 + 22^5.
-
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, 8):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 10])
for x in range(len(rets)):
print(rets[x])
Showing 1-6 of 6 results.
Comments