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.

A345516 Numbers that are the sum of six cubes in seven or more ways.

Original entry on oeis.org

1710, 1766, 1773, 1981, 1988, 2051, 2105, 2160, 2168, 2196, 2249, 2251, 2259, 2277, 2314, 2322, 2349, 2368, 2375, 2376, 2417, 2424, 2431, 2438, 2457, 2466, 2480, 2492, 2494, 2513, 2520, 2531, 2538, 2539, 2548, 2555, 2557, 2564, 2565, 2574, 2583, 2593, 2611
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			1766 is a term because 1766 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 11^3 = 1^3 + 1^3 + 1^3 + 5^3 + 5^3 + 10^3 = 1^3 + 1^3 + 2^3 + 3^3 + 8^3 + 9^3 = 1^3 + 3^3 + 3^3 + 5^3 + 8^3 + 8^3 = 1^3 + 3^3 + 3^3 + 4^3 + 7^3 + 9^3 = 2^3 + 2^3 + 3^3 + 6^3 + 6^3 + 9^3 = 3^3 + 3^3 + 3^3 + 3^3 + 5^3 + 10^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, 6):
        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])