A353724 a(n) = exponent of highest power of 2 that divides A353715(n).

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, 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, 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

Offset: 0

Author

N. J. A. Sloane, May 11 2022

Keywords

• nonn

Examples

			A353715(3) = 12 = 2^2*3, so a(3) = 2. A353715(11) = 104 = 2^3*13, so a(11) = 3.
		

Crossrefs

Cf. A353709, A353715, A353725, A353726.

Programs

Python

from itertools import count, islice
def A353724_gen(): # generator of terms
    s, a, b, c, ab = {0,1}, 0, 1, 2, 1
    yield 0
    while True:
        for n in count(c):
            if not (n & ab or n in s):
                yield len(t := bin(b+n))-len(t.rstrip('0'))
                a, b = b, n
                ab = a|b
                s.add(n)
                while c in s:
                    c += 1
                break
A353724_list = list(islice(A353724_gen(),30)) # Chai Wah Wu, May 11 2022