OFFSET
1,1
LINKS
David A. Corneth, Table of n, a(n) for n = 1..13916 (terms <= 200000)
PROG
(Python)
from itertools import count, takewhile, combinations_with_replacement as mc
def aupto(limit):
qd = list(takewhile(lambda x: x <= limit, (k**4 for k in count(1))))
ss = [set(sum(c) for c in mc(qd, i)) for i in range(13)]
for i in range(11, 0, -1): ss[12] -= ss[i]
return sorted(s for s in ss[12] if s <= limit)
print(aupto(762)) # Michael S. Branicky, Dec 27 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Arlin Anderson (starship1(AT)gmail.com)
EXTENSIONS
Typo in data corrected by D. S. McNeil, Aug 17 2010
STATUS
approved