108597

Appears in sequences

• Number of binary strings of length n+6 such that the smallest number whose binary representation is not visible in the string is 6.at n=19A261442
• a(1) = 1; if a(n) is not divisible by 3, a(n+1) = 4*a(n) + 1, otherwise a(n+1) = a(n)/3.at n=35A346035