login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
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
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Dec 18 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)