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 A357370 #16 Oct 06 2022 04:30:29 %S A357370 1,3,7,13,21,33,47,64,82,102,125,149,176,204,234,267,302,339,378,419, %T A357370 462,507,554,603,654,707,763,820,880,943,1008,1075,1143,1215,1288, %U A357370 1362,1437,1513,1592,1674,1757,1842,1928,2017,2107,2199,2293,2389,2487,2587,2690 %N A357370 Positions of 0's in A355917. %C A357370 A355916(2*a(n)-1) = 0. %H A357370 Michael De Vlieger, <a href="/A357370/b357370.txt">Table of n, a(n) for n = 1..10000</a> %t A357370 nn = 51; c[_] = 0; i = 1; Reap[Do[k = 0; While[c[k] > 0, Set[m, c[k]]; c[m]++; c[k]++; i += 2; k++]; Set[m, c[k]]; c[m]++; c[k]++; Sow[(i + 1)/2]; i += 2, {n, nn}] ][[-1, -1]] %o A357370 (Python) %o A357370 from itertools import count, islice %o A357370 from collections import Counter %o A357370 def agen(): %o A357370 yield 1 %o A357370 num, alst, inventory = 0, [0, 0], Counter([0, 0]) %o A357370 for n in count(2): %o A357370 c = [inventory[num], num] %o A357370 num = 0 if c[0] == 0 else num + 1 %o A357370 if c[0] == 0: yield n %o A357370 inventory.update(c) %o A357370 print(list(islice(agen(), 51))) # _Michael S. Branicky_, Oct 05 2022 %Y A357370 Cf. A355916, A355917, A357371. %K A357370 nonn %O A357370 1,2 %A A357370 _Michael De Vlieger_, Sep 25 2022