A146527 a(n) = number of distinct composites, when each is represented in binary, that occur as substrings within the binary representation of n.

0, 0, 0, 1, 0, 1, 0, 2, 2, 1, 0, 3, 1, 2, 1, 3, 2, 3, 2, 3, 2, 2, 0, 5, 5, 3, 2, 5, 2, 4, 1, 4, 4, 3, 3, 4, 3, 4, 3, 5, 4, 3, 2, 5, 3, 3, 1, 7, 6, 7, 6, 6, 4, 4, 3, 8, 8, 5, 3, 8, 4, 5, 2, 5, 5, 5, 4, 4, 4, 5, 3, 6, 4, 5, 4, 6, 5, 6, 4, 7, 6, 6, 4, 6, 4, 5, 3, 8, 7, 6, 5, 7, 4, 5, 2, 9, 8, 8, 8, 9, 7, 8, 7, 9, 8

Offset

1,8

Comments

a(n) = 0 for n equal to only the positive integers 1,2,3,5,7,11,23 (sequence A048278).

Links

Table of n, a(n) for n=1..105.

Example

20 in binary is 10100. The composites, when represented in binary, that can be found within 10100 are 4 = 100 in binary, 10 (decimal) = 1010 in binary and 20 itself = 10100 in binary. There are 3 of these composites, so a(20) = 3.

Crossrefs

A078826

Sequence in context: A068926 A276770 A258291 * A352556 A368282 A285099

Adjacent sequences: A146524 A146525 A146526 * A146528 A146529 A146530

Keyword

nonn

Author

Leroy Quet, Oct 30 2008

Extensions

Extended by Ray Chandler, Nov 03 2008

Status

approved