OFFSET
1,2
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..161
MATHEMATICA
c[_] = 0; j = c[1] = r = 1; s = 3; Prepend[Reap[Do[d = Divisors[s]; k = 1; While[c[d[[k]]] > 0, k++]; Set[k, d[[k]]]; Set[c[k], i]; If[k > r, r = k; Sow[r]]; j = k; s += k, {i, 2, 2100}] ][[-1, -1]], 1]
PROG
(Python)
from itertools import islice
from sympy import divisors
def A350741_gen(): # generator of terms
bset, c, s = {1}, 1, 3
yield 1
while True:
for d in divisors(s):
if d not in bset:
if d > c:
yield d
c = d
bset.add(d)
s += d
break
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael De Vlieger, Jan 23 2022
STATUS
approved