A346804 Numbers that are the sum of ten squares in five or more ways.

40, 45, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 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

Offset: 1

Author

David Consiglio, Jr., Aug 04 2021

Keywords

• nonn

Examples

			45 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 6^2
   = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 3^2 + 5^2
   = 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 3^2 + 4^2
   = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 3^2 + 3^2 + 3^2 + 3^2
   = 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 3^2
so 45 is a term.
		

Links

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

Crossrefs

Cf. A345502, A345553, A346805.

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