A346806 Numbers that are the sum of ten squares in seven or more ways.
57, 58, 60, 61, 63, 64, 66, 67, 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, 112, 113, 114, 115, 116, 117, 118, 119, 120
Offset: 1
Keywords
Examples
58 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 7^2 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 5^2 + 5^2 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 4^2 + 5^2 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 3^2 + 3^2 + 3^2 + 5^2 = 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 5^2 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 4^2 + 4^2 + 4^2 = 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 4^2 + 4^2 = 1^2 + 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 3^2 + 3^2 + 3^2 + 4^2 = 1^2 + 1^2 + 1^2 + 1^2 + 3^2 + 3^2 + 3^2 + 3^2 + 3^2 + 3^2 so 58 is a term.
Links
- Sean A. Irvine, Table of n, a(n) for n = 1..10000
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 >= 7]) for x in range(len(rets)): print(rets[x])