A352708 a(1) = 1, and for any n > 1, A109812(n) is the a(n)-th positive number k such that A109812(n-1) AND k = 0 (where AND denotes the bitwise AND operator).

1, 1, 2, 3, 2, 5, 3, 4, 6, 3, 5, 6, 5, 7, 4, 7, 3, 9, 10, 7, 5, 11, 6, 13, 5, 7, 6, 15, 4, 22, 7, 9, 13, 7, 9, 13, 7, 10, 15, 6, 27, 5, 19, 7, 11, 11, 12, 23, 7, 16, 29, 7, 17, 15, 7, 17, 23, 7, 18, 22, 11, 13, 13, 14, 14, 13, 11, 14, 15, 9, 27, 7, 19, 15, 12

Offset: 1

Author

Rémy Sigrist, Mar 30 2022

Keywords

• nonn
• look
• base

Comments

To compute the binary expansion of a(n) (for n > 1):

- take the binary expansion of A109812(n)

- and remove the bits corresponding to the 1's in the binary expansion of A109812(n-1).

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000
• Rémy Sigrist, Log-log scatterplot of the first 2^20 terms
• Rémy Sigrist, C++ program

Crossrefs

Cf. A109812.