This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A348440 #20 Oct 23 2021 03:22:03 %S A348440 1,2,3,5,6,7,11,12,13,17,19,23,25,29,31,37,41,43,47,53,59,61,67,71,73, %T A348440 79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167, %U A348440 173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293 %N A348440 Records in A088177. %C A348440 Apparently the terms agree with the prime numbers A000040, beginning at 29. - _Hugo Pfoertner_, Oct 21 2021 %H A348440 Chai Wah Wu, <a href="/A348440/b348440.txt">Table of n, a(n) for n = 1..10000</a> %t A348440 Block[{c, m = 1, n}, Union@ FoldList[Max, {1}~Join~Reap[Do[n = 1; While[IntegerQ[c[m n]], n++]; Sow[n]; Set[c[m n], 1]; m = n, 2^12]][[-1, -1]]]] (* _Michael De Vlieger_, Oct 21 2021 *) %o A348440 (Python) %o A348440 from itertools import islice %o A348440 def A348440(): # generator of terms %o A348440 yield 1 %o A348440 c, p, a = 1, {1}, 1 %o A348440 while True: %o A348440 n, na = 1, a %o A348440 while na in p: %o A348440 n += 1 %o A348440 na += a %o A348440 p.add(na) %o A348440 a = n %o A348440 if c < n: %o A348440 c = n %o A348440 yield c %o A348440 A348440_list = list(islice(A348440(),100)) # _Chai Wah Wu_, Oct 21 2021 %Y A348440 Cf. A088177, A088178, A348441. %K A348440 nonn %O A348440 1,2 %A A348440 _N. J. A. Sloane_, Oct 21 2021