474195

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=22A261442
• a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least two elements of S) > difference between greatest two elements of S.at n=19A357290