A345502 Numbers that are the sum of nine squares in five or more ways.

47, 48, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 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, 110, 111

Offset: 1

Author

David Consiglio, Jr., Jun 20 2021

Keywords

• nonn

Examples

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

Links

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

Crossrefs

Cf. A345492, A345501, A345503, A345544, A346804.

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