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-5 of 5 results.

A345543 Numbers that are the sum of nine cubes in four or more ways.

Original entry on oeis.org

224, 257, 264, 283, 320, 348, 355, 372, 374, 376, 381, 383, 390, 400, 402, 407, 409, 411, 413, 414, 416, 428, 435, 439, 442, 446, 450, 453, 454, 461, 465, 472, 474, 476, 479, 481, 486, 488, 491, 498, 500, 502, 503, 505, 507, 509, 510, 512, 514, 517, 519, 524
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			257 is a term because 257 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 4^3 + 4^3 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 5^3 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^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 >= 4])
        for x in range(len(rets)):
            print(rets[x])

A345551 Numbers that are the sum of ten cubes in three or more ways.

Original entry on oeis.org

197, 225, 232, 239, 246, 251, 253, 258, 260, 265, 267, 272, 277, 279, 281, 284, 286, 288, 291, 293, 295, 298, 300, 302, 303, 305, 307, 309, 310, 312, 314, 316, 317, 319, 321, 323, 324, 326, 328, 329, 330, 335, 336, 338, 340, 342, 343, 344, 345, 347, 349, 351
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			225 is a term because 225 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 5^3 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 = 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 = 1^3 + 2^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 >= 3])
        for x in range(len(rets)):
            print(rets[x])

A345553 Numbers that are the sum of ten cubes in five or more ways.

Original entry on oeis.org

288, 349, 382, 384, 401, 403, 408, 410, 414, 415, 417, 421, 429, 436, 440, 443, 447, 454, 455, 462, 466, 473, 475, 477, 480, 482, 487, 492, 496, 499, 501, 503, 506, 508, 510, 513, 515, 518, 520, 525, 527, 529, 532, 534, 536, 538, 539, 541, 543, 544, 545, 546
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			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.
		

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

A345597 Numbers that are the sum of ten fourth powers in four or more ways.

Original entry on oeis.org

1620, 2660, 2725, 2740, 2835, 2855, 2870, 2900, 2915, 2920, 2935, 2950, 2965, 2980, 3000, 3015, 3030, 3045, 3095, 3110, 3160, 3175, 3190, 3205, 3220, 3240, 3255, 3270, 3285, 3335, 3350, 3415, 3430, 3445, 3460, 3479, 3510, 3525, 3544, 3559, 3574, 3589, 3639
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			2660 is a term because 2660 = 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 6^4 + 6^4 = 1^4 + 1^4 + 1^4 + 3^4 + 4^4 + 4^4 + 4^4 + 4^4 + 4^4 + 6^4 = 1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 4^4 + 4^4 + 4^4 + 4^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, 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])

A345806 Numbers that are the sum of ten cubes in exactly four ways.

Original entry on oeis.org

225, 232, 251, 258, 265, 272, 284, 286, 291, 307, 310, 314, 321, 323, 328, 342, 347, 356, 363, 366, 373, 375, 377, 380, 389, 391, 398, 399, 405, 412, 419, 422, 424, 427, 434, 438, 441, 445, 450, 451, 458, 459, 461, 464, 469, 471, 476, 478, 481, 484, 488, 489
Offset: 1

Views

Author

David Consiglio, Jr., Jun 26 2021

Keywords

Comments

Differs from A345552 at term 9 because 288 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 4^3 + 6^3 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 4^3 + 4^3 + 4^3 + 4^3 = 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 5^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 6^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3.
Likely finite.

Examples

			232 is a term because 232 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 5^3 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 = 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 = 2^3 + 2^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 == 4])
        for x in range(len(rets)):
            print(rets[x])
Showing 1-5 of 5 results.