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 A353724 #12 May 11 2022 22:28:10
%S A353724 0,0,1,2,0,0,2,2,0,0,1,3,0,0,1,0,0,1,0,0,1,0,0,1,2,0,0,2,1,1,0,0,1,0,
%T A353724 0,1,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,3,0,0,4,0,0,2,0,0,2,0,0,1,0,0,1,3,
%U A353724 0,0,2,0,0,1,5,0,0,4,0,0,2,1,0,0,3,0,0,3,6,0,0,2,0,0,1,0,0,1,0,0,1,0,0,2,0,0,2,1,0,0,1,1,2,0,0,2,0
%N A353724 a(n) = exponent of highest power of 2 that divides A353715(n).
%e A353724 A353715(3) = 12 = 2^2*3, so a(3) = 2. A353715(11) = 104 = 2^3*13, so a(11) = 3.
%o A353724 (Python)
%o A353724 from itertools import count, islice
%o A353724 def A353724_gen(): # generator of terms
%o A353724 s, a, b, c, ab = {0,1}, 0, 1, 2, 1
%o A353724 yield 0
%o A353724 while True:
%o A353724 for n in count(c):
%o A353724 if not (n & ab or n in s):
%o A353724 yield len(t := bin(b+n))-len(t.rstrip('0'))
%o A353724 a, b = b, n
%o A353724 ab = a|b
%o A353724 s.add(n)
%o A353724 while c in s:
%o A353724 c += 1
%o A353724 break
%o A353724 A353724_list = list(islice(A353724_gen(),30)) # _Chai Wah Wu_, May 11 2022
%Y A353724 Cf. A353709, A353715, A353725, A353726.
%K A353724 nonn
%O A353724 0,4
%A A353724 _N. J. A. Sloane_, May 11 2022