OFFSET
1,2
COMMENTS
a(n)^5 forms a sum-free sequence.
LINKS
Bert Dobbelaere, Table of n, a(n) for n = 1..150
Wikipedia, Sum-free sequence
EXAMPLE
The smallest number > 0 that is not in the sequence is 12, because
12^5 = 4^5 + 5^5 + 6^5 + 7^5 + 9^5 + 11^5.
PROG
(Python)
def findSum(nopt, tgt, a, smax, pwr):
if nopt==0:
return [] if tgt==0 else None
if tgt<0 or tgt>smax[nopt-1]:
return None
rv=findSum(nopt-1, tgt - a[nopt-1]**pwr, a, smax, pwr)
if rv!=None:
rv.append(a[nopt-1])
else:
rv=findSum(nopt-1, tgt, a, smax, pwr)
return rv
def A321292(n):
POWER=5 ; x=0 ; a=[] ; smax=[] ; sumpwr=0
while len(a)<n:
while True:
x+=1
lst=findSum(len(a), x**POWER, a, smax, POWER)
if lst==None:
break
rhs = " + ".join(["%d^%d"%(i, POWER) for i in lst])
print(" %d^%d = %s"%(x, POWER, rhs))
a.append(x) ; sumpwr+=x**POWER
print("a(%d) = %d"%(len(a), x))
smax.append(sumpwr)
return a[-1]
CROSSREFS
KEYWORD
nonn
AUTHOR
Bert Dobbelaere, Nov 02 2018
STATUS
approved