OFFSET
5,1
COMMENTS
LINKS
Jānis Iraids, Table of n, a(n) for n = 5..89
PROG
(Python)
def aupton(nn):
alst, R = [], {0: {1}} # R[n] is set reachable using n+1 1's (n ops)
for n in range(1, nn):
R[n] = set(a+b for i in range(n//2+1) for a in R[i] for b in R[n-1-i])
R[n] |= set(a*b for i in range(n//2+1) for a in R[i] for b in R[n-1-i])
new = R[n] - R[n-1]
if n >= 4: alst.append(min(new - {min(new)}))
return alst
print(aupton(35)) # Michael S. Branicky, Jun 08 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, with terms computed by Janis Iraids, Dec 15 2015
STATUS
approved