A345515 -id:A345515 - cp's OEIS frontend

A345174 Numbers that are the sum of five third powers in six or more ways.

2430, 2979, 3214, 3249, 3312, 3492, 3520, 3737, 3753, 3788, 3816, 3842, 3942, 3968, 4121, 4185, 4213, 4267, 4355, 4392, 4411, 4418, 4446, 4453, 4456, 4465, 4472, 4482, 4509, 4544, 4563, 4600, 4626, 4663, 4670, 4723, 4753, 4896, 4905, 4915, 4924, 4938, 4941

Offset: 1

David Consiglio, Jr., Jun 10 2021

nonn

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

David Consiglio, Jr., Table of n, a(n) for n = 1..10000

Cf. A343989, A344799, A344940, A345148, A345175, A345180, A345515.

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, 5):
    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])

A345514 Numbers that are the sum of six cubes in five or more ways.

Original entry on oeis.org

1045, 1169, 1241, 1260, 1377, 1384, 1432, 1440, 1488, 1495, 1530, 1539, 1549, 1556, 1558, 1584, 1586, 1594, 1595, 1602, 1612, 1617, 1640, 1647, 1654, 1657, 1673, 1675, 1677, 1703, 1710, 1712, 1715, 1719, 1729, 1736, 1738, 1745, 1747, 1754, 1764, 1766, 1771

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			1169 is a term because 1169 = 1^3 + 2^3 + 2^3 + 3^3 + 4^3 + 9^3 = 1^3 + 2^3 + 5^3 + 5^3 + 5^3 + 7^3 = 1^3 + 3^3 + 4^3 + 4^3 + 4^3 + 8^3 = 2^3 + 3^3 + 3^3 + 4^3 + 5^3 + 8^3 = 3^3 + 3^3 + 3^3 + 3^3 + 7^3 + 7^3.

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

Cf. A343989, A344809, A345513, A345515, A345523, A345562, A345767.

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, 6):
    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])

A345516 Numbers that are the sum of six cubes in seven or more ways.

Original entry on oeis.org

1710, 1766, 1773, 1981, 1988, 2051, 2105, 2160, 2168, 2196, 2249, 2251, 2259, 2277, 2314, 2322, 2349, 2368, 2375, 2376, 2417, 2424, 2431, 2438, 2457, 2466, 2480, 2492, 2494, 2513, 2520, 2531, 2538, 2539, 2548, 2555, 2557, 2564, 2565, 2574, 2583, 2593, 2611

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			1766 is a term because 1766 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 11^3 = 1^3 + 1^3 + 1^3 + 5^3 + 5^3 + 10^3 = 1^3 + 1^3 + 2^3 + 3^3 + 8^3 + 9^3 = 1^3 + 3^3 + 3^3 + 5^3 + 8^3 + 8^3 = 1^3 + 3^3 + 3^3 + 4^3 + 7^3 + 9^3 = 2^3 + 2^3 + 3^3 + 6^3 + 6^3 + 9^3 = 3^3 + 3^3 + 3^3 + 3^3 + 5^3 + 10^3.

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

Cf. A344811, A345180, A345515, A345517, A345525, A345564, A345769.

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, 6):
    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])

A345524 Numbers that are the sum of seven cubes in six or more ways.

Original entry on oeis.org

955, 969, 1046, 1053, 1072, 1079, 1107, 1117, 1121, 1158, 1161, 1170, 1177, 1184, 1196, 1198, 1216, 1222, 1235, 1242, 1254, 1261, 1268, 1272, 1280, 1287, 1291, 1294, 1297, 1298, 1305, 1310, 1324, 1350, 1351, 1355, 1366, 1369, 1376, 1378, 1385, 1388, 1392

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345483, A345515, A345523, A345525, A345536, A345572, A345778.

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, 7):
    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])

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

Original entry on oeis.org

21251, 37811, 38051, 43251, 43571, 43875, 44115, 44531, 45155, 45651, 45891, 47411, 47586, 48276, 49796, 49971, 52195, 53235, 53315, 54131, 56290, 57395, 57460, 57570, 58035, 58500, 59075, 59330, 59780, 59795, 59811, 59860, 60035, 62180, 62211, 63971, 66340

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A344940, A345515, A345562, A345564, A345572, A345720, A345818.

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, 6):
    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])

A345768 Numbers that are the sum of six cubes in exactly six ways.

Original entry on oeis.org

1377, 1488, 1586, 1595, 1647, 1673, 1677, 1738, 1764, 1799, 1829, 1836, 1837, 1862, 1881, 1890, 1911, 1953, 1955, 2007, 2011, 2014, 2018, 2025, 2044, 2070, 2079, 2097, 2107, 2108, 2142, 2153, 2170, 2177, 2203, 2214, 2216, 2222, 2223, 2226, 2229, 2252, 2258

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345515 at term 8 because 1710 = 1^3 + 1^3 + 5^3 + 5^3 + 9^3 + 9^3 = 1^3 + 2^3 + 3^3 + 6^3 + 9^3 + 9^3 = 1^3 + 2^3 + 4^3 + 5^3 + 8^3 + 10^3 = 1^3 + 4^3 + 4^3 + 5^3 + 5^3 + 11^3 = 2^3 + 2^3 + 2^3 + 7^3 + 7^3 + 10^3 = 2^3 + 3^3 + 4^3 + 4^3 + 6^3 + 11^3 = 4^3 + 4^3 + 5^3 + 6^3 + 8^3 + 9^3.

			1488 is a term because 1488 = 1^3 + 1^3 + 1^3 + 3^3 + 8^3 + 8^3 = 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 10^3 = 1^3 + 2^3 + 3^3 + 6^3 + 6^3 + 8^3 = 2^3 + 2^3 + 2^3 + 2^3 + 4^3 + 10^3 = 3^3 + 3^3 + 3^3 + 3^3 + 6^3 + 9^3 = 3^3 + 5^3 + 5^3 + 6^3 + 6^3 + 6^3.

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

Cf. A345175, A345515, A345767, A345769, A345778, A345818.

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, 6):
    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])

A344810 Numbers that are the sum of six squares in six or more ways.

Original entry on oeis.org

54, 57, 60, 62, 65, 68, 69, 71, 72, 75, 76, 77, 78, 80, 81, 83, 84, 86, 87, 88, 89, 90, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			57 = 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 7^2
   = 1^2 + 1^2 + 1^2 + 2^2 + 5^2 + 5^2
   = 1^2 + 1^2 + 1^2 + 3^2 + 3^2 + 6^2
   = 1^2 + 2^2 + 2^2 + 4^2 + 4^2 + 4^2
   = 1^2 + 2^2 + 3^2 + 3^2 + 3^2 + 5^2
   = 2^2 + 2^2 + 2^2 + 2^2 + 4^2 + 5^2
so 57 is a term.

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

Cf. A344799, A344809, A344811, A345483, A345515.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**2 for x in range(1, 1000)]
for pos in cwr(power_terms, 6):
    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])

Conjectures from Chai Wah Wu, Apr 25 2024: (Start)
a(n) = 2*a(n-1) - a(n-2) for n > 24.
G.f.: x*(-x^23 + x^22 - x^18 + x^17 - x^16 + x^15 - x^14 + x^13 - 2*x^10 + 2*x^9 - x^8 + x^7 - 2*x^6 + x^4 - x^3 - 51*x + 54)/(x - 1)^2. (End)

cp's OEIS Frontend

A345174 Numbers that are the sum of five third powers in six or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345514 Numbers that are the sum of six cubes in five or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345516 Numbers that are the sum of six cubes in seven or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345524 Numbers that are the sum of seven cubes in six or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345768 Numbers that are the sum of six cubes in exactly six ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A344810 Numbers that are the sum of six squares in six or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Formula