A345824 -id:A345824 - cp's OEIS frontend

A345568 Numbers that are the sum of seven fourth powers in two or more ways.

262, 277, 292, 307, 342, 357, 372, 422, 437, 502, 517, 532, 547, 597, 612, 677, 772, 787, 852, 886, 901, 916, 966, 981, 1027, 1046, 1141, 1156, 1221, 1362, 1377, 1396, 1442, 1510, 1525, 1557, 1572, 1587, 1590, 1617, 1637, 1652, 1717, 1765, 1812, 1827, 1892

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			277 is a term because 277 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 4^4 = 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4.

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

Cf. A003341, A345520, A345559, A345569, A345577, A345605, A345824.

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

A345814 Numbers that are the sum of six fourth powers in exactly two ways.

Original entry on oeis.org

261, 276, 291, 341, 356, 421, 516, 531, 596, 771, 885, 900, 965, 1140, 1361, 1509, 1556, 1571, 1636, 1811, 2180, 2596, 2611, 2661, 2691, 2706, 2721, 2741, 2756, 2771, 2786, 2836, 2931, 2946, 2961, 3011, 3026, 3091, 3186, 3201, 3220, 3266, 3285, 3300, 3315

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345559 at term 25 because 2676 = 1^4 + 1^4 + 2^4 + 4^4 + 7^4 = 1^4 + 1^4 + 1^4 + 3^4 + 6^4 + 6^4 = 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 7^4.

			276 is a term because 276 = 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 4^4 = 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4.

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

Cf. A048930, A344237, A345559, A345813, A345815, A345824, A346357.

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

A345825 Numbers that are the sum of seven fourth powers in exactly three ways.

Original entry on oeis.org

2677, 2692, 2757, 2852, 2867, 2917, 2997, 3107, 3172, 3301, 3476, 3541, 3972, 4132, 4227, 4242, 4257, 4307, 4322, 4372, 4437, 4452, 4482, 4497, 4562, 4627, 4737, 4756, 4851, 4866, 4867, 4931, 4996, 5077, 5106, 5107, 5122, 5187, 5252, 5282, 5317, 5347, 5362

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345569 at term 7 because 2932 = 1^4 + 1^4 + 1^4 + 2^4 + 4^4 + 4^4 + 7^4 = 1^4 + 1^4 + 1^4 + 3^4 + 4^4 + 6^4 + 6^4 = 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4.

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

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

Cf. A345569, A345775, A345815, A345824, A345826, A345835, A346280.

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

A345834 Numbers that are the sum of eight fourth powers in exactly two ways.

Original entry on oeis.org

263, 278, 293, 308, 323, 343, 358, 373, 388, 423, 438, 453, 503, 533, 548, 563, 583, 598, 613, 628, 678, 693, 758, 773, 788, 803, 853, 868, 887, 902, 917, 932, 933, 967, 982, 997, 1028, 1043, 1047, 1062, 1108, 1127, 1142, 1157, 1172, 1222, 1237, 1283, 1302

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345577 at term 14 because 518 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 4^4 + 4^4 = 1^4 + 1^4 + 1^4 + 2^4 + 3^4 + 3^4 + 3^4 + 4^4 = 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 3^4 + 3^4.

			278 is a term because 278 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 4^4 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4.

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

Cf. A345577, A345784, A345824, A345833, A345835, A345844, A346327.

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

A345774 Numbers that are the sum of seven cubes in exactly two ways.

Original entry on oeis.org

131, 159, 166, 173, 185, 192, 211, 236, 243, 257, 264, 269, 274, 276, 288, 290, 292, 295, 299, 300, 302, 307, 309, 311, 314, 320, 321, 325, 332, 333, 337, 339, 340, 344, 348, 351, 353, 355, 358, 359, 360, 363, 372, 384, 385, 386, 388, 389, 393, 395, 398, 403

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345520 at term 8 because 222 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 6^3 = 1^3 + 1^3 + 1^3 + 3^3 + 4^3 + 4^3 + 4^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 4^3 + 5^3.

Likely finite.

			159 is a term because 159 = 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 4^3.

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

Cf. A048930, A345520, A345773, A345775, A345784, A345824.

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

A345823 Numbers that are the sum of seven fourth powers in exactly one ways.

Original entry on oeis.org

7, 22, 37, 52, 67, 82, 87, 97, 102, 112, 117, 132, 147, 162, 167, 177, 182, 197, 212, 227, 242, 247, 322, 327, 337, 352, 387, 402, 407, 417, 452, 467, 482, 487, 562, 567, 577, 582, 592, 627, 631, 642, 646, 657, 661, 662, 676, 691, 692, 706, 707, 711, 721, 722

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A003341 at term 23 because 262 = 1^4 + 1^4 + 1^4 + 2^4 + 3^4 + 3^4 + 3^4 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 4^4.

			22 is a term because 22 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 2^4.

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

Cf. A003341, A345773, A345813, A345824, A345833, A346278.

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

A346279 Numbers that are the sum of seven fifth powers in exactly two ways.

Original entry on oeis.org

4099, 4130, 4161, 4341, 4372, 4583, 5122, 5153, 5364, 6145, 7223, 7254, 7465, 8246, 10347, 11874, 11905, 12116, 12897, 14998, 19649, 20905, 20936, 21147, 21928, 24029, 28680, 36866, 36897, 37108, 37711, 37889, 39990, 40138, 44641, 51393, 51448, 51479, 51510

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345605 at term 156 because 84457 = 2^5 + 4^5 + 4^5 + 6^5 + 6^5 + 6^5 + 9^5 = 1^5 + 3^5 + 5^5 + 6^5 + 6^5 + 8^5 + 8^5 = 1^5 + 3^5 + 4^5 + 7^5 + 7^5 + 7^5 + 8^5.

			4099 is a term because 4099 = 1^5 + 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5 = 1^5 + 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5.

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

Cf. A345605, A345824, A346278, A346280, A346327, A346357.

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

cp's OEIS Frontend

A345568 Numbers that are the sum of seven fourth powers in two or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345814 Numbers that are the sum of six fourth powers in exactly two ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345825 Numbers that are the sum of seven fourth powers in exactly three ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345834 Numbers that are the sum of eight fourth powers in exactly two ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345774 Numbers that are the sum of seven cubes in exactly two ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345823 Numbers that are the sum of seven fourth powers in exactly one ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A346279 Numbers that are the sum of seven fifth powers in exactly two ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python