A345841
Numbers that are the sum of eight fourth powers in exactly nine ways.
Original entry on oeis.org
15427, 16692, 17348, 17493, 18052, 18227, 19267, 19412, 19572, 19748, 20852, 21443, 21493, 21637, 21652, 21653, 21827, 21877, 21972, 22037, 22212, 22388, 22501, 22548, 22868, 22932, 23107, 23412, 23413, 23428, 23828, 23893, 23972, 24037, 24131, 24212, 24517
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])
A346286
Numbers that are the sum of seven fifth powers in exactly nine ways.
Original entry on oeis.org
110276376, 124732805, 127808693, 130298618, 188116743, 202274051, 202686274, 203343582, 230909843, 233137574, 233549568, 234250752, 244250335, 251138524, 253480833, 254017026, 254380543, 265006057, 265072501, 273628068, 279536432, 279770326, 280361082
Offset: 1
110276376 is a term because 110276376 = 1^5 + 3^5 + 5^5 + 7^5 + 17^5 + 23^5 + 40^5 = 5^5 + 10^5 + 16^5 + 16^5 + 19^5 + 20^5 + 40^5 = 1^5 + 8^5 + 14^5 + 16^5 + 21^5 + 27^5 + 39^5 = 7^5 + 8^5 + 11^5 + 14^5 + 16^5 + 33^5 + 37^5 = 4^5 + 7^5 + 8^5 + 13^5 + 26^5 + 31^5 + 37^5 = 1^5 + 5^5 + 6^5 + 20^5 + 28^5 + 29^5 + 37^5 = 3^5 + 3^5 + 7^5 + 18^5 + 27^5 + 32^5 + 36^5 = 6^5 + 12^5 + 18^5 + 25^5 + 30^5 + 31^5 + 34^5 = 6^5 + 10^5 + 20^5 + 27^5 + 27^5 + 33^5 + 33^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])
A346333
Numbers that are the sum of eight fifth powers in exactly eight ways.
Original entry on oeis.org
8625619, 9773236, 10036233, 10071050, 12247994, 13180706, 13377868, 13662501, 14584992, 14591744, 14611077, 15251119, 16112362, 16374250, 16391025, 16472544, 16588000, 16667851, 17059075, 17216298, 17405300, 17917097, 18107564, 18392902, 18470839, 18541635
Offset: 1
8625619 is a term because 8625619 = 2^5 + 5^5 + 5^5 + 9^5 + 10^5 + 12^5 + 12^5 + 24^5 = 1^5 + 3^5 + 8^5 + 9^5 + 11^5 + 11^5 + 12^5 + 24^5 = 2^5 + 2^5 + 3^5 + 8^5 + 9^5 + 16^5 + 16^5 + 23^5 = 1^5 + 3^5 + 3^5 + 4^5 + 11^5 + 17^5 + 18^5 + 22^5 = 4^5 + 11^5 + 13^5 + 13^5 + 15^5 + 15^5 + 16^5 + 22^5 = 5^5 + 6^5 + 13^5 + 15^5 + 15^5 + 16^5 + 19^5 + 20^5 = 3^5 + 10^5 + 12^5 + 12^5 + 16^5 + 18^5 + 18^5 + 20^5 = 3^5 + 8^5 + 14^5 + 14^5 + 14^5 + 18^5 + 18^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])
A346344
Numbers that are the sum of nine fifth powers in exactly nine ways.
Original entry on oeis.org
1969221, 2596936, 3353186, 3378178, 3923426, 3981447, 4094027, 4096729, 4112329, 4114188, 4129465, 4137209, 4147736, 4170112, 4172994, 4254304, 4303773, 4410482, 4475846, 4477936, 4483379, 4485480, 4501441, 4543232, 4652011, 4691855, 4724015, 4733970, 4750241
Offset: 1
1969221 is a term because 1969221 = 3^5 + 5^5 + 6^5 + 7^5 + 8^5 + 11^5 + 11^5 + 14^5 + 16^5 = 3^5 + 5^5 + 6^5 + 6^5 + 8^5 + 12^5 + 12^5 + 13^5 + 16^5 = 3^5 + 4^5 + 7^5 + 7^5 + 7^5 + 12^5 + 12^5 + 13^5 + 16^5 = 1^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 14^5 + 14^5 + 15^5 = 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 10^5 + 13^5 + 14^5 + 15^5 = 2^5 + 2^5 + 4^5 + 10^5 + 11^5 + 11^5 + 12^5 + 14^5 + 15^5 = 1^5 + 4^5 + 5^5 + 8^5 + 9^5 + 13^5 + 13^5 + 13^5 + 15^5 = 1^5 + 2^5 + 7^5 + 7^5 + 11^5 + 11^5 + 14^5 + 14^5 + 14^5 = 1^5 + 2^5 + 6^5 + 7^5 + 12^5 + 12^5 + 13^5 + 14^5 + 14^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])
A345617
Numbers that are the sum of eight fifth powers in nine or more ways.
Original entry on oeis.org
8742208, 15539667, 18913169, 19987308, 20135313, 21505583, 21512966, 21563089, 21727552, 22237510, 22256608, 22438990, 22545600, 22686818, 22932525, 23106589, 23122550, 23189782, 23221517, 23287858, 23346048, 23477344, 23798742, 23847285, 23931325, 24138358
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 >= 9])
for x in range(len(rets)):
print(rets[x])
A346335
Numbers that are the sum of eight fifth powers in exactly ten ways.
Original entry on oeis.org
15539667, 22932525, 24393600, 24650406, 24952961, 24953742, 25142513, 26001294, 27988486, 28609075, 29309819, 31794336, 32223105, 32527286, 32610600, 32807777, 32890541, 32998317, 33015125, 33187858, 33361339, 33550572, 33659175, 33782597, 34029369, 34073650
Offset: 1
15539667 is a term because 15539667 = 1^5 + 7^5 + 8^5 + 8^5 + 8^5 + 14^5 + 14^5 + 27^5 = 1^5 + 4^5 + 7^5 + 9^5 + 13^5 + 13^5 + 13^5 + 27^5 = 1^5 + 1^5 + 7^5 + 7^5 + 10^5 + 16^5 + 19^5 + 26^5 = 1^5 + 1^5 + 2^5 + 10^5 + 12^5 + 17^5 + 18^5 + 26^5 = 2^5 + 2^5 + 3^5 + 8^5 + 9^5 + 16^5 + 23^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 = 3^5 + 10^5 + 12^5 + 12^5 + 18^5 + 18^5 + 20^5 + 24^5 = 6^5 + 9^5 + 11^5 + 11^5 + 15^5 + 21^5 + 22^5 + 22^5 = 3^5 + 5^5 + 10^5 + 19^5 + 19^5 + 20^5 + 20^5 + 21^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