cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A229905 Number of binary words of length n with exactly one occurrence of the subword given by the binary expansion of n.

Original entry on oeis.org

0, 1, 1, 2, 4, 10, 30, 26, 78, 156, 278, 722, 1827, 3140, 7800, 5810, 21016, 40260, 76104, 173836, 394492, 520775, 1376090, 3080882, 6887040, 12734023, 28266044, 44217698, 114969792, 211934801, 464129402, 354151217, 1360414116, 2644465928, 5134476403
Offset: 0

Views

Author

Alois P. Heinz, Dec 19 2013

Keywords

Examples

			a(1) = 1: 1.
a(2) = 1: 10.
a(3) = 2: 011, 110.
a(4) = 4: 0100, 1000, 1001, 1100.
a(5) = 10: 00101, 01010, 01011, 01101, 10100, 10110, 10111, 11010, 11011, 11101.
		

Crossrefs

Column k=1 of A233940.