A346348 Numbers that are the sum of ten fifth powers in exactly three ways.

8194, 21940, 52419, 52450, 52481, 52661, 52692, 52903, 53442, 53473, 53684, 54465, 54520, 54551, 54582, 54762, 54793, 55004, 55691, 55722, 55933, 56714, 57644, 57675, 57886, 58815, 60194, 60225, 60436, 60768, 61217, 62295, 62326, 62537, 63466, 65419, 67969

Offset

1,1

Comments

Differs from A345635 at term 19 because 55543 = 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5 + 5^5 + 6^5 + 6^5 + 8^5 = 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5 + 5^5 + 6^5 + 6^5 + 8^5 = 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 4^5 + 5^5 + 7^5 + 7^5 + 7^5 = 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 7^5 + 7^5 + 7^5.

Links

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Example

8194 is a term because 8194 = 3^5 + 3^5 + 3^5 + 3^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5 + 5^5 = 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 4^5 + 4^5 + 4^5 + 4^5 + 5^5 = 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5.

Prog

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

Crossrefs

Cf. A345635, A345855, A346338, A346347, A346349.

Sequence in context: A036091 A181134 A345635 * A253713 A168346 A331357

Adjacent sequences: A346345 A346346 A346347 * A346349 A346350 A346351

Keyword

nonn

Author

David Consiglio, Jr., Jul 13 2021

Status

approved