OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
EXAMPLE
PROG
(Python)
from itertools import islice
def agen(): # generator of terms
mina, an, aset, mink, kset = 1, 1, {1}, 1, set()
while True:
k1, ak1, k2 = 0, mina, mink
if mina < an:
for ak1 in range(mina, an-mink+1):
if ak1 not in aset and an - ak1 not in kset:
k1 = an - ak1
break
while k2 in kset or an*k2 in aset:
k2 += 1
an, k = (an-k1, k1) if k1 > 0 else (an*k2, k2)
yield -k if k1 > 0 else k
aset.add(an)
kset.add(k)
while mina in aset: mina += 1
while mink in kset: mink += 1
print(list(islice(agen(), 56))) # Michael S. Branicky, Mar 18 2024
CROSSREFS
KEYWORD
sign
AUTHOR
Neal Gersh Tolunsky, Mar 17 2024
EXTENSIONS
a(12) and beyond from Michael S. Branicky, Mar 18 2024
STATUS
approved