A229293 Number of binary words of length n with exactly k (possibly overlapping) occurrences of the subword given by the binary expansion of n for maximal k with at least one word.

1, 1, 1, 1, 4, 1, 1, 1, 1, 18, 1, 6, 1, 1, 40, 1, 8, 1, 4, 33, 1, 1, 17, 42, 1120, 1, 12, 11, 448, 1, 1, 1, 84, 52, 1, 985, 1, 10, 1, 316, 3360, 1, 1, 75, 144, 1, 1, 12, 1, 504, 180, 15, 7920, 102, 1, 16, 220, 14, 11440, 17, 1, 1, 264, 1, 20, 3206, 399, 1, 4

Offset

0,5

Links

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Example

a(4) = 4 because there are 4 binary words of length 4 with one occurrence of 100, namely 0100, 1000, 1001, 1100, and no words with more than one occurrence of 100.

Crossrefs

Last (positive) terms of rows of A233940.

Sequence in context: A079982 A265143 A181873 * A269443 A039927 A336722

Adjacent sequences: A229290 A229291 A229292 * A229294 A229295 A229296

Keyword

nonn

Author

Alois P. Heinz, Dec 18 2013

Status

approved