A078827 Number of primes contained as binary substrings in binary representation of n, counted with repetitions.
0, 0, 1, 1, 1, 2, 2, 3, 1, 1, 3, 4, 2, 4, 4, 5, 1, 2, 2, 3, 3, 4, 5, 7, 2, 2, 5, 6, 4, 7, 6, 8, 1, 1, 3, 3, 2, 4, 4, 5, 3, 4, 5, 7, 5, 7, 8, 10, 2, 3, 3, 4, 5, 7, 7, 9, 4, 4, 8, 10, 6, 10, 9, 11, 1, 1, 2, 3, 3, 4, 4, 6, 2, 3, 5, 6, 4, 6, 6, 8, 3, 4, 5, 7, 5, 6, 8, 10, 5, 6, 8, 9, 8, 11, 11, 13, 2, 3, 4, 4, 3
Offset: 0
Examples
n=7 -> '111' contains 3 binary substrings which are primes: '11' (11b), '11' (b11) and '111' itself, therefore a(7)=2.