OFFSET
0,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 0..2102
MATHEMATICA
f[n_] := Block[{k = 1}, While[Length@PowersRepresentations[k, 3, 2] != n, k++]; k]; Table[f[n], {n, 0, 44}] (* Ray Chandler, Oct 31 2019 *)
PROG
(Python)
from collections import Counter
from itertools import count, combinations_with_replacement as mc
def aupto(lim):
sq = filter(lambda x: x<=lim, (i**2 for i in range(int(lim**(1/2))+2)))
s3 = filter(lambda x: 0<x<=lim, (sum(m) for m in mc(sq, 3)))
counts, alst = Counter(s3), [7]
for n in count(1):
mink = min((k for k in counts if counts[k]==n), default=False)
if not mink: break
alst.append(mink)
return alst
print(aupto(11600)) # Michael S. Branicky, Jul 01 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Nov 14 2006, Nov 20 2006
EXTENSIONS
Extended by Ray Chandler, Nov 30 2006
a(45) and beyond from Michael S. Branicky, Jul 01 2021
STATUS
approved