A345621 -id:A345621 - cp's OEIS frontend

A345588 Numbers that are the sum of nine fourth powers in four or more ways.

2854, 2919, 2934, 2949, 2964, 3014, 3029, 3094, 3159, 3174, 3189, 3204, 3254, 3269, 3429, 3444, 3558, 3573, 3638, 3798, 3813, 3974, 4034, 4134, 4149, 4164, 4179, 4182, 4209, 4214, 4229, 4244, 4274, 4294, 4309, 4374, 4389, 4404, 4419, 4439, 4454, 4469, 4484

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345543, A345579, A345587, A345589, A345597, A345621, A345846.

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

A345612 Numbers that are the sum of eight fifth powers in four or more ways.

Original entry on oeis.org

391250, 392031, 455750, 519236, 604822, 622281, 672023, 672054, 672265, 673554, 697492, 703978, 707368, 730259, 763292, 857761, 893605, 893636, 893816, 893847, 894027, 894058, 894452, 894628, 896729, 897151, 901380, 903839, 909124, 909597, 910411, 911403

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345579, A345607, A345611, A345613, A345621, A346329.

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

A345620 Numbers that are the sum of nine fifth powers in three or more ways.

Original entry on oeis.org

52418, 52449, 52660, 53441, 54519, 54550, 54761, 55542, 55690, 57643, 60193, 62294, 69224, 69635, 69666, 69877, 70658, 70955, 70986, 71197, 71325, 71978, 72759, 73001, 74079, 76031, 77410, 78730, 84162, 84459, 84490, 84521, 84701, 84732, 84943, 85185, 85482

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345587, A345611, A345619, A345621, A345635, A346338.

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

A345622 Numbers that are the sum of nine fifth powers in five or more ways.

Original entry on oeis.org

392063, 392274, 406559, 458875, 519237, 538291, 607947, 663871, 672024, 672055, 672266, 672297, 673586, 673797, 674578, 675390, 680041, 681330, 704582, 704822, 714299, 730260, 732603, 763027, 763324, 765873, 766417, 777820, 780099, 814082, 820887, 825678

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345589, A345613, A345621, A345623, A345637, A346340.

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

A346339 Numbers that are the sum of nine fifth powers in exactly four ways.

Original entry on oeis.org

55542, 120350, 143507, 167241, 182549, 192233, 202890, 326685, 327986, 328247, 329028, 329809, 333257, 351722, 358474, 358968, 359210, 359538, 359813, 365404, 367071, 367313, 374034, 374846, 375627, 376619, 377158, 379259, 381157, 383910, 384765, 390396

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345621 at term 37 because 392063 = 2^5 + 2^5 + 4^5 + 5^5 + 5^5 + 5^5 + 8^5 + 10^5 + 12^5 = 2^5 + 2^5 + 3^5 + 3^5 + 6^5 + 7^5 + 9^5 + 9^5 + 12^5 = 2^5 + 2^5 + 4^5 + 4^5 + 4^5 + 6^5 + 9^5 + 11^5 + 11^5 = 1^5 + 2^5 + 3^5 + 4^5 + 5^5 + 8^5 + 8^5 + 11^5 + 11^5 = 1^5 + 1^5 + 1^5 + 3^5 + 8^5 + 9^5 + 10^5 + 10^5 + 10^5.

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

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

Cf. A345621, A345846, A346329, A346338, A346340, A346349.

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

A345636 Numbers that are the sum of ten fifth powers in four or more ways.

Original entry on oeis.org

55543, 55574, 55785, 56566, 58667, 63318, 72349, 73002, 85186, 86506, 87287, 87529, 88310, 103134, 111498, 113599, 114591, 118250, 119031, 120351, 120382, 120593, 121374, 123475, 128126, 134475, 134878, 135201, 137157, 142008, 142219, 143000, 143211, 143506

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A345597, A345621, A345635, A345637, A346349.

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

cp's OEIS Frontend

A345588 Numbers that are the sum of nine fourth powers in four or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345612 Numbers that are the sum of eight fifth powers in four or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345620 Numbers that are the sum of nine fifth powers in three or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345622 Numbers that are the sum of nine fifth powers in five or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A346339 Numbers that are the sum of nine fifth powers in exactly four ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345636 Numbers that are the sum of ten fifth powers in four or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python