cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-7 of 7 results.

A345536 Numbers that are the sum of eight cubes in six or more ways.

Original entry on oeis.org

628, 719, 769, 776, 778, 795, 832, 839, 846, 858, 860, 865, 872, 875, 876, 882, 886, 891, 893, 895, 901, 902, 907, 908, 912, 921, 927, 928, 931, 938, 945, 946, 947, 951, 954, 956, 958, 963, 964, 965, 970, 972, 977, 982, 984, 989, 991, 992, 996, 998, 999, 1001
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Links

Crossrefs

Cf. A345493, A345524, A345535, A345537, A345545, A345581, A345788.

Programs

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

A345544 Numbers that are the sum of nine cubes in five or more ways.

Original entry on oeis.org

409, 413, 428, 435, 439, 446, 465, 472, 479, 491, 498, 502, 505, 507, 512, 517, 524, 526, 531, 533, 535, 538, 540, 559, 561, 563, 566, 568, 570, 576, 579, 580, 587, 594, 596, 598, 600, 601, 603, 605, 613, 615, 617, 620, 622, 624, 627, 629, 631, 632, 633, 635
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Links

Crossrefs

Cf. A345502, A345535, A345543, A345545, A345553, A345589, A345797.

Programs

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

A345546 Numbers that are the sum of nine cubes in seven or more ways.

Original entry on oeis.org

624, 629, 631, 650, 657, 687, 694, 707, 713, 720, 727, 744, 746, 753, 755, 763, 768, 770, 777, 779, 781, 784, 786, 789, 792, 796, 798, 803, 805, 807, 818, 820, 822, 824, 831, 833, 840, 842, 844, 847, 848, 849, 854, 859, 861, 866, 868, 870, 873, 875, 876, 877
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Links

Crossrefs

Cf. A345504, A345537, A345545, A345547, A345555, A345591, A345799.

Programs

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

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

Original entry on oeis.org

4469, 4484, 5444, 5459, 5524, 5589, 5699, 5764, 6629, 6659, 6674, 6694, 6724, 6739, 6789, 6804, 6854, 6869, 6884, 6899, 6914, 6934, 6949, 6964, 6979, 7014, 7029, 7044, 7094, 7109, 7154, 7219, 7269, 7284, 7334, 7348, 7349, 7413, 7459, 7478, 7494, 7523, 7524
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Links

Crossrefs

Cf. A345545, A345581, A345589, A345591, A345599, A345623, A345848.

Programs

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

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

Original entry on oeis.org

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

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			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.

Links

Crossrefs

Cf. A345545, A345553, A345555, A345599, A345808, A346805.

Programs

  • Python
    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

Views

Author

David Consiglio, Jr., Jun 26 2021

Keywords

Comments

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.

Examples

			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.

Links

Crossrefs

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

Programs

  • Python
    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])

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

Original entry on oeis.org

48, 56, 57, 59, 60, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 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
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Comments

Numbers n such that A025433(n) >= 6. - David A. Corneth, Apr 26 2024

Examples

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

Links

Crossrefs

Cf. A025433, A345493, A345502, A345504, A345545, A346805.

Programs

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

Formula

Conjectures from Chai Wah Wu, Apr 25 2024: (Start)
a(n) = 2*a(n-1) - a(n-2) for n > 9.
G.f.: x*(-x^8 + x^7 - x^6 + x^5 - x^4 + x^3 - 7*x^2 - 40*x + 48)/(x - 1)^2. (End)
Showing 1-7 of 7 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.