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.

A345537 Numbers that are the sum of eight cubes in seven or more ways.

Original entry on oeis.org

902, 908, 921, 938, 958, 963, 970, 977, 982, 984, 991, 996, 1003, 1008, 1010, 1017, 1019, 1028, 1029, 1033, 1047, 1054, 1055, 1058, 1061, 1062, 1070, 1073, 1075, 1080, 1087, 1090, 1091, 1094, 1096, 1097, 1099, 1104, 1106, 1108, 1110, 1111, 1113, 1115, 1116
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Crossrefs

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

A345545 Numbers that are the sum of nine cubes in six or more ways.

Original entry on oeis.org

472, 498, 505, 507, 524, 596, 598, 605, 624, 629, 631, 636, 643, 650, 655, 657, 661, 662, 669, 672, 676, 681, 687, 688, 690, 692, 694, 696, 706, 707, 713, 718, 720, 722, 725, 727, 728, 729, 731, 732, 737, 739, 742, 744, 746, 748, 749, 750, 751, 753, 755, 756
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

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.
		

Crossrefs

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

A345547 Numbers that are the sum of nine cubes in eight or more ways.

Original entry on oeis.org

744, 770, 805, 818, 840, 842, 844, 847, 859, 861, 866, 868, 877, 880, 883, 887, 894, 896, 903, 908, 909, 910, 911, 913, 915, 916, 920, 922, 929, 935, 939, 940, 945, 946, 948, 950, 952, 954, 955, 957, 959, 961, 964, 965, 966, 971, 972, 973, 976, 978, 983, 985
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Crossrefs

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

A345591 Numbers that are the sum of nine fourth powers in seven or more ways.

Original entry on oeis.org

6739, 6804, 6854, 6869, 6979, 7029, 7044, 7094, 7109, 7269, 7284, 7844, 7909, 7939, 8004, 8019, 8084, 8149, 8194, 8244, 8259, 8309, 8324, 8389, 8434, 8499, 8564, 8628, 8739, 8868, 8979, 9044, 9059, 9124, 9189, 9219, 9234, 9254, 9284, 9299, 9364, 9414, 9429
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			6804 is a term because 6804 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 4^4 + 7^4 + 8^4 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 6^4 + 6^4 + 8^4 = 1^4 + 1^4 + 1^4 + 4^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 9^4 = 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 7^4 + 8^4 = 2^4 + 2^4 + 3^4 + 3^4 + 4^4 + 4^4 + 6^4 + 7^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 6^4 + 6^4 + 6^4 + 7^4 = 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4 + 6^4 + 6^4 + 6^4.
		

Crossrefs

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

A345555 Numbers that are the sum of ten cubes in seven or more ways.

Original entry on oeis.org

440, 473, 499, 506, 525, 532, 534, 567, 571, 584, 588, 597, 599, 604, 606, 623, 625, 627, 630, 632, 637, 639, 640, 644, 651, 656, 658, 660, 662, 663, 665, 669, 670, 673, 677, 680, 682, 684, 688, 689, 691, 693, 695, 696, 697, 699, 701, 702, 704, 707, 708, 714
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			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.
		

Crossrefs

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

A345799 Numbers that are the sum of nine cubes in exactly seven ways.

Original entry on oeis.org

624, 629, 631, 650, 657, 687, 694, 707, 713, 720, 727, 746, 753, 755, 763, 768, 777, 779, 781, 784, 786, 789, 792, 796, 798, 803, 807, 820, 822, 824, 831, 833, 848, 849, 854, 870, 873, 875, 876, 879, 884, 885, 889, 890, 892, 898, 899, 901, 902, 904, 905, 906
Offset: 1

Views

Author

David Consiglio, Jr., Jun 26 2021

Keywords

Comments

Differs from A345546 at term 12 because 744 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 9^3 = 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 4^3 + 4^3 + 6^3 + 7^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 5^3 + 5^3 + 5^3 + 7^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 5^3 + 6^3 + 7^3 = 1^3 + 3^3 + 3^3 + 4^3 + 5^3 + 5^3 + 5^3 + 5^3 + 5^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 4^3 + 8^3 = 2^3 + 3^3 + 3^3 + 3^3 + 4^3 + 5^3 + 5^3 + 5^3 + 6^3 = 3^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 4^3 + 4^3 + 7^3.
Likely finite.

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.
		

Crossrefs

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

A345504 Numbers that are the sum of nine squares in seven or more ways.

Original entry on oeis.org

57, 60, 62, 63, 65, 66, 68, 69, 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, 118, 119, 120, 121
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

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

Crossrefs

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