OFFSET
1,1
LINKS
David A. Corneth, Table of n, a(n) for n = 1..15256
PROG
(PARI) upto(n)={my(e=10); my(s=sum(k=1, sqrtint(sqrtint(n)), x^(k^4)) + O(x*x^n)); my(p=s^e, q=(1 + s)^(e-1)); select(k->polcoeff(p, k) && !polcoeff(q, k), [1..n])} \\ Andrew Howroyd, Jul 06 2018
(Python)
from itertools import count, takewhile, combinations_with_replacement as mc
def aupto(lim):
p4 = list(takewhile(lambda x: x <= lim, (i**4 for i in count(1))))
s = [set(sum(c) for c in mc(p4, i) if sum(c) <= lim) for i in range(11)]
ans = s[10]
for i in range(1, 10):
ans -= s[i]
return sorted(ans)
print(aupto(730)) # Michael S. Branicky, Oct 25 2021
KEYWORD
nonn
AUTHOR
Arlin Anderson (starship1(AT)gmail.com)
STATUS
approved