A345808 -id:A345808 - cp's OEIS frontend

A345554 Numbers that are the sum of ten cubes in six or more ways.

436, 440, 447, 466, 473, 477, 480, 492, 499, 503, 506, 508, 510, 513, 515, 518, 525, 527, 529, 532, 534, 536, 538, 539, 541, 551, 553, 560, 562, 564, 567, 569, 571, 577, 581, 584, 588, 590, 595, 597, 599, 601, 602, 603, 604, 606, 607, 608, 613, 614, 616, 618

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			440 is a term because 440 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 5^3 + 5^3 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3 = 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 + 5^3 = 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 = 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 = 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 = 2^3 + 3^3 + 3^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. A345545, A345553, A345555, A345599, A345808, A346805.

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

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

Original entry on oeis.org

472, 498, 505, 507, 524, 596, 598, 605, 636, 643, 655, 661, 662, 669, 672, 676, 681, 688, 690, 692, 696, 706, 718, 722, 725, 728, 729, 731, 732, 737, 739, 742, 748, 749, 750, 751, 756, 765, 772, 782, 783, 785, 787, 788, 791, 793, 794, 800, 801, 802, 808, 810

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345545 at term 9 because 624 = 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 8^3 = 1^3 + 1^3 + 1^3 + 3^3 + 4^3 + 4^3 + 5^3 + 5^3 + 6^3 = 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 4^3 + 4^3 + 6^3 + 6^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 5^3 + 5^3 + 5^3 + 6^3 = 1^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 4^3 + 4^3 + 7^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 5^3 + 6^3 + 6^3 = 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 4^3 + 4^3 + 5^3 + 5^3.

Likely finite.

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

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

Cf. A345545, A345788, A345797, A345799, A345808, A345848.

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

A345858 Numbers that are the sum of ten fourth powers in exactly six ways.

Original entry on oeis.org

3175, 4150, 4230, 4390, 4405, 4455, 4470, 4500, 4550, 4565, 4630, 4725, 4740, 4915, 4980, 5094, 5109, 5155, 5190, 5205, 5220, 5270, 5285, 5350, 5365, 5395, 5430, 5475, 5635, 5655, 5735, 5910, 5955, 6020, 6069, 6084, 6149, 6195, 6214, 6324, 6389, 6435, 6500

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345599 at term 8 because 4485 = 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 3^4 + 4^4 + 8^4 = 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 4^4 + 4^4 + 4^4 + 6^4 + 7^4 = 1^4 + 1^4 + 1^4 + 1^4 + 3^4 + 4^4 + 4^4 + 6^4 + 6^4 + 6^4 = 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 8^4 = 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 4^4 + 6^4 + 7^4 = 1^4 + 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 4^4 + 6^4 + 6^4 + 6^4 = 2^4 + 2^4 + 2^4 + 2^4 + 5^4 + 5^4 + 5^4 + 5^4 + 5^4 + 6^4.

			4150 is a term because 4150 = 1^4 + 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 + 1^4 + 4^4 + 6^4 + 6^4 + 6^4 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 4^4 + 6^4 + 7^4 = 1^4 + 1^4 + 1^4 + 2^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4 + 6^4 = 1^4 + 4^4 + 4^4 + 4^4 + 4^4 + 5^4 + 5^4 + 5^4 + 5^4 + 5^4 = 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 7^4.

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

Cf. A345599, A345808, A345848, A345857, A345859, A346351.

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

A345807 Numbers that are the sum of ten cubes in exactly five ways.

Original entry on oeis.org

288, 349, 382, 384, 401, 403, 408, 410, 414, 415, 417, 421, 429, 443, 454, 455, 462, 475, 482, 487, 496, 501, 520, 543, 544, 545, 546, 548, 555, 556, 558, 565, 566, 570, 573, 574, 575, 576, 578, 580, 582, 586, 587, 591, 592, 593, 594, 600, 609, 610, 611, 617

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345553 at term 14 because 436 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 4^3 + 7^3 = 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 4^3 + 4^3 + 5^3 + 5^3 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 + 6^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 5^3 + 5^3 + 5^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 5^3 + 6^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 4^3 + 4^3.

Likely finite.

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

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

Cf. A345553, A345797, A345806, A345808, A345857.

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

A345809 Numbers that are the sum of ten cubes in exactly seven ways.

Original entry on oeis.org

440, 473, 499, 506, 525, 532, 534, 567, 571, 584, 588, 597, 599, 604, 606, 627, 637, 639, 640, 656, 660, 663, 669, 670, 673, 680, 682, 689, 691, 693, 696, 701, 702, 704, 707, 717, 718, 719, 726, 729, 735, 738, 743, 744, 750, 755, 761, 762, 763, 770, 783, 784

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345555 at term 16 because 623 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 5^3 + 5^3 + 5^3 + 6^3 = 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 5^3 + 6^3 + 6^3 = 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 5^3 + 7^3 = 1^3 + 1^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 5^3 + 5^3 + 5^3 = 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 5^3 + 6^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 6^3 + 7^3 = 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 + 5^3 + 5^3 + 5^3 + 5^3 = 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 7^3.

Likely finite.

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

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

Cf. A345555, A345799, A345808, A345810, A345859.

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, 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

A345554 Numbers that are the sum of ten cubes in six or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345858 Numbers that are the sum of ten fourth powers in exactly six ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345807 Numbers that are the sum of ten cubes in exactly five ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345809 Numbers that are the sum of ten cubes in exactly seven ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python