A346342 -id:A346342 - cp's OEIS frontend

A345849 Numbers that are the sum of nine fourth powers in exactly seven ways.

6739, 6854, 6979, 7029, 7044, 7094, 7109, 7269, 7284, 7844, 7909, 7939, 8004, 8149, 8194, 8244, 8309, 8389, 8434, 8628, 8739, 8868, 8979, 9059, 9189, 9254, 9414, 9509, 9524, 9668, 9684, 9734, 9814, 9829, 9843, 9844, 9908, 9909, 9924, 9989, 10019, 10038, 10084

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345591 at term 2 because 6804 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 4^4 + 7^4 + 8^4 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 6^4 + 6^4 + 8^4 = 1^4 + 1^4 + 1^4 + 4^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 9^4 = 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 7^4 + 8^4 = 2^4 + 2^4 + 3^4 + 3^4 + 4^4 + 4^4 + 6^4 + 7^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4 + 6^4 + 6^4 + 6^4.

			6804 is a term because 6804 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 4^4 + 7^4 + 8^4 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 6^4 + 6^4 + 8^4 = 1^4 + 1^4 + 1^4 + 4^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 9^4 = 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 7^4 + 8^4 = 2^4 + 2^4 + 3^4 + 3^4 + 4^4 + 4^4 + 6^4 + 7^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4 + 6^4 + 6^4 + 6^4.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A345591, A345799, A345839, A345848, A345850, A345859, A346342.

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, 9):
    tot = sum(pos)
    keep[tot] += 1
    rets = sorted([k for k, v in keep.items() if v == 7])
    for x in range(len(rets)):
        print(rets[x])

A345624 Numbers that are the sum of nine fifth powers in seven or more ways.

Original entry on oeis.org

1431398, 1431429, 1431640, 1439173, 1447570, 1504636, 1531397, 1597929, 1671167, 1696159, 1697686, 1697928, 1778835, 1936454, 1952415, 1969221, 1975049, 2017344, 2092122, 2182161, 2198967, 2208680, 2247917, 2280818, 2283911, 2289343, 2314335, 2329845, 2340319

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			1431429 is a term because 1431429 = 1^5 + 2^5 + 2^5 + 6^5 + 7^5 + 12^5 + 12^5 + 13^5 + 14^5 = 1^5 + 2^5 + 2^5 + 7^5 + 7^5 + 11^5 + 11^5 + 14^5 + 14^5 = 1^5 + 2^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 14^5 + 15^5 = 1^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 10^5 + 14^5 + 15^5 = 2^5 + 2^5 + 2^5 + 4^5 + 10^5 + 11^5 + 11^5 + 12^5 + 15^5 = 2^5 + 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 10^5 + 13^5 + 15^5 = 2^5 + 3^5 + 5^5 + 6^5 + 7^5 + 8^5 + 11^5 + 11^5 + 16^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A345591, A345615, A345623, A345625, A345639, A346342.

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 >= 7])
    for x in range(len(rets)):
        print(rets[x])

A346332 Numbers that are the sum of eight fifth powers in exactly seven ways.

Original entry on oeis.org

4104553, 4915506, 6011150, 6027989, 6323394, 6563733, 6622231, 6776363, 6785394, 7982834, 8181481, 8288806, 8658144, 8710484, 8773477, 8932244, 8996669, 9252219, 9253706, 9311478, 9904983, 9976120, 10045233, 10053008, 10193511, 10359767, 10514944, 10541225

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345615 at term 13 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.

			4104553 is a term because 4104553 = 1^5 + 1^5 + 2^5 + 3^5 + 3^5 + 5^5 + 7^5 + 21^5 = 3^5 + 3^5 + 4^5 + 6^5 + 8^5 + 14^5 + 16^5 + 19^5 = 3^5 + 3^5 + 3^5 + 7^5 + 9^5 + 12^5 + 18^5 + 18^5 = 3^5 + 4^5 + 4^5 + 4^5 + 11^5 + 11^5 + 18^5 + 18^5 = 1^5 + 1^5 + 4^5 + 7^5 + 10^5 + 16^5 + 16^5 + 18^5 = 7^5 + 11^5 + 11^5 + 13^5 + 14^5 + 15^5 + 16^5 + 16^5 = 6^5 + 12^5 + 12^5 + 13^5 + 13^5 + 15^5 + 16^5 + 16^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A345615, A345839, A346284, A346331, A346333, A346342.

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 == 7])
    for x in range(len(rets)):
        print(rets[x])

A346341 Numbers that are the sum of nine fifth powers in exactly six ways.

Original entry on oeis.org

926404, 936607, 952896, 985421, 993574, 993605, 993816, 1075779, 1123321, 1133344, 1134367, 1151406, 1160105, 1166111, 1177144, 1206514, 1209669, 1209847, 1215545, 1225630, 1251130, 1264929, 1265320, 1278611, 1414834, 1422367, 1422609, 1430384, 1431367

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345623 at term 30 because 1431398 = 2^5 + 5^5 + 5^5 + 5^5 + 6^5 + 7^5 + 10^5 + 12^5 + 16^5 = 1^5 + 3^5 + 5^5 + 6^5 + 7^5 + 8^5 + 11^5 + 11^5 + 16^5 = 1^5 + 1^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 14^5 + 15^5 = 2^5 + 3^5 + 4^5 + 4^5 + 7^5 + 8^5 + 12^5 + 13^5 + 15^5 = 1^5 + 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 10^5 + 13^5 + 15^5 = 1^5 + 2^5 + 2^5 + 4^5 + 10^5 + 11^5 + 11^5 + 12^5 + 15^5 = 1^5 + 1^5 + 2^5 + 7^5 + 7^5 + 11^5 + 11^5 + 14^5 + 14^5 = 1^5 + 1^5 + 2^5 + 6^5 + 7^5 + 12^5 + 12^5 + 13^5 + 14^5.

			926404 is a term because 926404 = 2^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 8^5 + 10^5 + 15^5 = 2^5 + 4^5 + 6^5 + 6^5 + 7^5 + 7^5 + 7^5 + 10^5 + 15^5 = 2^5 + 2^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 8^5 + 15^5 = 2^5 + 2^5 + 2^5 + 7^5 + 7^5 + 8^5 + 11^5 + 11^5 + 14^5 = 2^5 + 2^5 + 2^5 + 6^5 + 7^5 + 8^5 + 12^5 + 12^5 + 13^5 = 1^5 + 1^5 + 4^5 + 4^5 + 7^5 + 11^5 + 12^5 + 12^5 + 12^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A345623, A345848, A346331, A346340, A346342, A346351.

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 == 6])
    for x in range(len(rets)):
        print(rets[x])

A346343 Numbers that are the sum of nine fifth powers in exactly eight ways.

Original entry on oeis.org

1431398, 1431640, 1531397, 1952415, 2247917, 2530399, 2652563, 2652860, 2736790, 2851254, 2965588, 3088909, 3148674, 3273590, 3297416, 3329120, 3329362, 3332244, 3336895, 3345442, 3345653, 3361614, 3362217, 3364738, 3553641, 3571549, 3577951, 3609926, 3610155

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345625 at term 5 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.

			1431398 is a term because 1431398 = 2^5 + 5^5 + 5^5 + 5^5 + 6^5 + 7^5 + 10^5 + 12^5 + 16^5 = 1^5 + 3^5 + 5^5 + 6^5 + 7^5 + 8^5 + 11^5 + 11^5 + 16^5 = 1^5 + 1^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 14^5 + 15^5 = 2^5 + 3^5 + 4^5 + 4^5 + 7^5 + 8^5 + 12^5 + 13^5 + 15^5 = 1^5 + 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 10^5 + 13^5 + 15^5 = 1^5 + 2^5 + 2^5 + 4^5 + 10^5 + 11^5 + 11^5 + 12^5 + 15^5 = 1^5 + 1^5 + 2^5 + 7^5 + 7^5 + 11^5 + 11^5 + 14^5 + 14^5 = 1^5 + 1^5 + 2^5 + 6^5 + 7^5 + 12^5 + 12^5 + 13^5 + 14^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A345625, A345850, A346333, A346342, A346344, A346353.

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 == 8])
    for x in range(len(rets)):
        print(rets[x])

A346352 Numbers that are the sum of ten fifth powers in exactly seven ways.

Original entry on oeis.org

555098, 674040, 683166, 707315, 763631, 777852, 778844, 780945, 783224, 893654, 896500, 897668, 920887, 926616, 927819, 928802, 936850, 937631, 945017, 952897, 953077, 953350, 955178, 963131, 975133, 979482, 984133, 985664, 987257, 991908, 993575, 993606

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345639 at term 19 because 944383 = 4^5 + 4^5 + 4^5 + 6^5 + 7^5 + 8^5 + 8^5 + 8^5 + 9^5 + 15^5 = 2^5 + 5^5 + 5^5 + 5^5 + 6^5 + 6^5 + 8^5 + 10^5 + 12^5 + 14^5 = 2^5 + 4^5 + 5^5 + 5^5 + 7^5 + 7^5 + 7^5 + 10^5 + 12^5 + 14^5 = 2^5 + 4^5 + 4^5 + 6^5 + 6^5 + 6^5 + 9^5 + 11^5 + 11^5 + 14^5 = 1^5 + 3^5 + 5^5 + 6^5 + 6^5 + 8^5 + 8^5 + 11^5 + 11^5 + 14^5 = 1^5 + 3^5 + 4^5 + 7^5 + 7^5 + 7^5 + 8^5 + 11^5 + 11^5 + 14^5 = 1^5 + 3^5 + 4^5 + 6^5 + 7^5 + 7^5 + 8^5 + 12^5 + 12^5 + 13^5 = 1^5 + 1^5 + 2^5 + 6^5 + 7^5 + 10^5 + 11^5 + 11^5 + 12^5 + 12^5.

			555098 is a term because 555098 = 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5 + 7^5 + 14^5 = 1^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 7^5 + 8^5 + 10^5 + 13^5 = 1^5 + 4^5 + 6^5 + 6^5 + 7^5 + 7^5 + 7^5 + 7^5 + 10^5 + 13^5 = 1^5 + 2^5 + 5^5 + 7^5 + 8^5 + 8^5 + 8^5 + 8^5 + 8^5 + 13^5 = 4^5 + 4^5 + 4^5 + 5^5 + 5^5 + 5^5 + 8^5 + 10^5 + 11^5 + 12^5 = 3^5 + 3^5 + 4^5 + 4^5 + 6^5 + 7^5 + 9^5 + 9^5 + 11^5 + 12^5 = 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 6^5 + 9^5 + 11^5 + 11^5 + 11^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A345639, A345859, A346342, A346351, A346353.

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, 10):
    tot = sum(pos)
    keep[tot] += 1
    rets = sorted([k for k, v in keep.items() if v == 7])
    for x in range(len(rets)):
        print(rets[x])

cp's OEIS Frontend

A345849 Numbers that are the sum of nine fourth powers in exactly seven ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345624 Numbers that are the sum of nine fifth powers in seven or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A346332 Numbers that are the sum of eight fifth powers in exactly seven ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A346341 Numbers that are the sum of nine fifth powers in exactly six ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A346343 Numbers that are the sum of nine fifth powers in exactly eight ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A346352 Numbers that are the sum of ten fifth powers in exactly seven ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python