A345580 -id:A345580 - cp's OEIS frontend

A345535 Numbers that are the sum of eight cubes in five or more ways.

471, 497, 504, 597, 623, 628, 630, 635, 642, 649, 654, 661, 667, 680, 686, 691, 693, 712, 717, 719, 723, 728, 736, 738, 741, 743, 752, 754, 755, 762, 769, 774, 776, 778, 780, 781, 783, 784, 785, 788, 791, 793, 795, 797, 800, 802, 804, 810, 813, 814, 815, 817

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			497 is a term because 497 = 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 4^3 + 4^3 + 5^3 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 5^3 + 5^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 6^3 = 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3.

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

Cf. A345492, A345523, A345534, A345536, A345544, A345580, A345787.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**3 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 >= 5])
    for x in range(len(rets)):
        print(rets[x])

A345571 Numbers that are the sum of seven fourth powers in five or more ways.

Original entry on oeis.org

6642, 6707, 6772, 6882, 6947, 7922, 7987, 8227, 8962, 9267, 9507, 9747, 10116, 10291, 10722, 10787, 10867, 10932, 10962, 11331, 11411, 11571, 12676, 12851, 12916, 13187, 13252, 13891, 13956, 14131, 14211, 14707, 14772, 14802, 14917, 14932, 14947, 15012, 15092

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345523, A345562, A345570, A345572, A345580, A345608, A345827.

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

A345579 Numbers that are the sum of eight fourth powers in four or more ways.

Original entry on oeis.org

2933, 2948, 3013, 3173, 3188, 3557, 4148, 4163, 4213, 4228, 4293, 4388, 4403, 4453, 4468, 4643, 4772, 4837, 4883, 5012, 5123, 5188, 5203, 5268, 5333, 5363, 5378, 5398, 5428, 5443, 5508, 5538, 5573, 5603, 5618, 5668, 5683, 5733, 5748, 5858, 5923, 6052, 6163

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			2948 is a term because 2948 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 4^4 + 4^4 + 7^4 = 1^4 + 1^4 + 1^4 + 2^4 + 3^4 + 4^4 + 6^4 + 6^4 = 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 7^4 = 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4.

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

Cf. A345534, A345570, A345578, A345580, A345588, A345612, A345836.

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

A345581 Numbers that are the sum of eight fourth powers in six or more ways.

Original entry on oeis.org

6723, 6788, 6853, 6898, 6963, 7028, 7938, 8003, 8068, 8178, 8243, 8308, 8483, 8963, 9043, 9173, 9218, 9283, 9348, 9413, 9493, 9523, 9668, 9763, 9828, 10003, 10132, 10258, 10277, 10307, 10372, 10628, 10708, 10738, 10788, 10803, 10868, 10933, 10948, 10978

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345536, A345572, A345580, A345582, A345590, A345614, A345838.

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

A345589 Numbers that are the sum of nine fourth powers in five or more ways.

Original entry on oeis.org

3189, 4149, 4229, 4244, 4309, 4374, 4404, 4419, 4469, 4484, 4549, 4659, 4724, 4853, 4899, 5028, 5093, 5139, 5189, 5204, 5269, 5284, 5349, 5379, 5414, 5444, 5459, 5509, 5524, 5574, 5589, 5619, 5634, 5654, 5684, 5699, 5749, 5764, 5814, 5829, 5939, 6068, 6133

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			4149 is a term because 4149 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 8^4 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 4^4 + 6^4 + 6^4 + 6^4 = 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 4^4 + 6^4 + 7^4 = 1^4 + 1^4 + 2^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4 + 6^4 = 4^4 + 4^4 + 4^4 + 4^4 + 5^4 + 5^4 + 5^4 + 5^4 + 5^4.

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

Cf. A345544, A345580, A345588, A345590, A345598, A345622, A345847.

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

A345837 Numbers that are the sum of eight fourth powers in exactly five ways.

Original entry on oeis.org

4228, 4403, 4468, 5443, 5508, 5683, 6613, 6643, 6658, 6708, 6773, 6838, 6868, 6883, 6948, 7013, 7093, 7138, 7203, 7267, 7268, 7332, 7397, 7478, 7507, 7572, 7588, 7828, 7858, 7923, 7988, 8113, 8133, 8228, 8353, 8418, 8533, 8547, 8548, 8612, 8723, 8788, 8852

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345580 at term 11 because 6723 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 6^4 + 6^4 + 8^4 = 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 9^4 = 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 7^4 + 8^4 = 2^4 + 2^4 + 3^4 + 4^4 + 4^4 + 6^4 + 7^4 + 7^4 = 2^4 + 3^4 + 3^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 3^4 + 3^4 + 3^4 + 6^4 + 6^4 + 6^4 + 6^4 + 6^4.

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

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

Cf. A345580, A345787, A345827, A345836, A345838, A345847, A346330.

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

A345613 Numbers that are the sum of eight fifth powers in five or more ways.

Original entry on oeis.org

926372, 952653, 993573, 1133343, 1414591, 1431366, 1431397, 1447327, 1597928, 1637020, 1663391, 1697685, 1876624, 1933329, 1992377, 1993376, 1993666, 2033328, 2091879, 2175912, 2182160, 2231110, 2280544, 2280575, 2280786, 2281567, 2283668, 2329602, 2345563

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345580, A345608, A345612, A345614, A345622, A346330.

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

cp's OEIS Frontend

A345535 Numbers that are the sum of eight cubes in five or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345571 Numbers that are the sum of seven fourth powers in five or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345579 Numbers that are the sum of eight fourth powers in four or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345581 Numbers that are the sum of eight fourth powers in six or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345589 Numbers that are the sum of nine fourth powers in five or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345837 Numbers that are the sum of eight fourth powers in exactly five ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345613 Numbers that are the sum of eight fifth powers in five or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python