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.

A346334 Numbers that are the sum of eight fifth powers in exactly nine ways.

Original entry on oeis.org

8742208, 18913169, 19987308, 20135313, 21505583, 21512966, 21563089, 21727552, 22237510, 22256608, 22438990, 22545600, 22686818, 23106589, 23122550, 23189782, 23221517, 23287858, 23346048, 23477344, 23798742, 23847285, 23931325, 24138358, 24385108, 24394139
Offset: 1

Views

Author

David Consiglio, Jr., Jul 13 2021

Keywords

Comments

Differs from A345617 at term 2 because 15539667 = 1^5 + 7^5 + 8^5 + 8^5 + 8^5 + 14^5 + 14^5 + 27^5 = 1^5 + 4^5 + 7^5 + 9^5 + 13^5 + 13^5 + 13^5 + 27^5 = 1^5 + 1^5 + 7^5 + 7^5 + 10^5 + 16^5 + 19^5 + 26^5 = 1^5 + 1^5 + 2^5 + 10^5 + 12^5 + 17^5 + 18^5 + 26^5 = 2^5 + 2^5 + 3^5 + 8^5 + 9^5 + 16^5 + 23^5 + 24^5 = 4^5 + 11^5 + 13^5 + 13^5 + 15^5 + 15^5 + 22^5 + 24^5 = 5^5 + 6^5 + 13^5 + 15^5 + 15^5 + 19^5 + 20^5 + 24^5 = 3^5 + 10^5 + 12^5 + 12^5 + 18^5 + 18^5 + 20^5 + 24^5 = 6^5 + 9^5 + 11^5 + 11^5 + 15^5 + 21^5 + 22^5 + 22^5 = 3^5 + 5^5 + 10^5 + 19^5 + 19^5 + 20^5 + 20^5 + 21^5.

Examples

			8742208 is a term because 8742208 = 1^5 + 1^5 + 2^5 + 3^5 + 5^5 + 7^5 + 15^5 + 24^5 = 4^5 + 4^5 + 8^5 + 8^5 + 9^5 + 15^5 + 17^5 + 23^5 = 1^5 + 3^5 + 7^5 + 12^5 + 12^5 + 13^5 + 17^5 + 23^5 = 2^5 + 5^5 + 6^5 + 7^5 + 15^5 + 15^5 + 15^5 + 23^5 = 1^5 + 1^5 + 9^5 + 9^5 + 11^5 + 17^5 + 18^5 + 22^5 = 3^5 + 3^5 + 7^5 + 9^5 + 12^5 + 12^5 + 21^5 + 21^5 = 4^5 + 4^5 + 4^5 + 11^5 + 11^5 + 12^5 + 21^5 + 21^5 = 10^5 + 12^5 + 12^5 + 13^5 + 16^5 + 16^5 + 19^5 + 20^5 = 8^5 + 13^5 + 14^5 + 14^5 + 14^5 + 16^5 + 19^5 + 20^5.
		

Crossrefs

Programs

  • Python
    from itertools import combinations_with_replacement as cwr
    from collections import defaultdict
    keep = defaultdict(lambda: 0)
    power_terms = [x**5 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 == 9])
        for x in range(len(rets)):
            print(rets[x])