A345499 Numbers that are the sum of nine squares in two or more ways.
24, 27, 30, 32, 33, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 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
Offset: 1
Keywords
Examples
27 is a term because 27 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 4^2 = 1^2 + 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2.
Links
- Sean A. Irvine, Table of n, a(n) for n = 1..1000
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 >= 2]) for x in range(len(rets)): print(rets[x])