OFFSET
1,2
COMMENTS
For the binary Champernowne string starting from 1 see A030302. In the first 100000 terms the fixed points are 1, 2, 12, 24, 25; it is likely no more exist. The sequence is conjectured to be a permutation of the positive integers.
LINKS
Scott R. Shannon, Image of the first 100000 terms. The green line is a(n) = n.
EXAMPLE
a(3) = 4 as the sum of the first 3 bits of the binary Champernowne string is 1 + 1 + 0 = 2, and 4 is the smallest unused number that shares a factor with 2.
a(10) = 9 as the sum of the first 10 bits of the binary Champernowne string is 1 + 1 + 0 + 1 + 1 + 1 + 0 + 0 + 1 + 0 = 6, and 9 is the smallest unused number that shares a factor with 6.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Scott R. Shannon, Dec 16 2022
STATUS
approved