cp's OEIS Frontend

A350741 Records in A095258.

%I A350741 #32 Jan 26 2022 02:30:58
%S A350741 1,3,4,6,9,27,34,68,94,235,289,578,799,1921,9683,16021,27421,54842,
%T A350741 69301,138602,434789,1787371,5179771,5655149,9653251,10209853,
%U A350741 20419706,43184409,301039141,611363527,1274384647,5084853899,14906805553,14946637163,22591381313,69291164983
%N A350741 Records in A095258.
%H A350741 Michael De Vlieger, <a href="/A350741/b350741.txt">Table of n, a(n) for n = 1..161</a>
%t A350741 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]
%o A350741 (Python)
%o A350741 from itertools import islice
%o A350741 from sympy import divisors
%o A350741 def A350741_gen(): # generator of terms
%o A350741     bset, c, s = {1}, 1, 3
%o A350741     yield 1
%o A350741     while True:
%o A350741         for d in divisors(s):
%o A350741             if d not in bset:
%o A350741                 if d > c:
%o A350741                     yield d
%o A350741                     c = d
%o A350741                 bset.add(d)
%o A350741                 s += d
%o A350741                 break
%o A350741 A350741_list = list(islice(A350741_gen(),20)) # _Chai Wah Wu_, Jan 25 2022
%Y A350741 Cf. A095258.
%K A350741 nonn
%O A350741 1,2
%A A350741 _Michael De Vlieger_, Jan 23 2022