Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Aug 05 2021 07:19:54
%S 46,47,49,53,54,55,56,58,59,61,62,63,64,65,66,67,68,69,70,71,72,73,74,
%T 75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,
%U 98,99,100,101,102,103,104,105,106,107,108,109,110,111,112
%N Numbers that are the sum of eight squares in five or more ways.
%H Sean A. Irvine, <a href="/A345492/b345492.txt">Table of n, a(n) for n = 1..1000</a>
%e 47 is a term because 47 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 4^2 + 5^2 = 1^2 + 1^2 + 1^2 + 1^2 + 3^2 + 3^2 + 3^2 + 4^2 = 1^2 + 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 4^2 + 4^2 = 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 5^2 = 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 3^2 + 3^2 + 3^2.
%o (Python)
%o from itertools import combinations_with_replacement as cwr
%o from collections import defaultdict
%o keep = defaultdict(lambda: 0)
%o power_terms = [x**2 for x in range(1, 1000)]
%o for pos in cwr(power_terms, 8):
%o tot = sum(pos)
%o keep[tot] += 1
%o rets = sorted([k for k, v in keep.items() if v >= 5])
%o for x in range(len(rets)):
%o print(rets[x])
%Y Cf. A345482, A345491, A345493, A345502, A345535.
%K nonn
%O 1,1
%A _David Consiglio, Jr._, Jun 20 2021