OFFSET
1,1
LINKS
David A. Corneth, Table of n, a(n) for n = 1..16998 (terms <= 200000)
PROG
(PARI) upto(n)={my(e=5); 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 combinations_with_replacement as combs_with_rep
def aupto(limit):
qd = [k**4 for k in range(1, int(limit**.25)+2) if k**4 + 4 <= limit]
ss = [set(sum(c) for c in combs_with_rep(qd, k)) for k in range(6)]
return sorted(filter(lambda x: x <= limit, ss[5]-ss[4]-ss[3]-ss[2]-ss[1]))
print(aupto(800)) # Michael S. Branicky, May 20 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Arlin Anderson (starship1(AT)gmail.com)
STATUS
approved
