A164415 - OEIS

This site is supported by donations to The OEIS Foundation.

Now is the time of year when we ask all users of the OEIS for their annual support.
Click here to donate to the OEIS Foundation using PayPal or in other ways.

A164415

Number of binary strings of length n with no substrings equal to 0000 0001 or 1100

13, 22, 38, 65, 112, 193, 332, 572, 985, 1696, 2921, 5030, 8662, 14917, 25688, 44237, 76180, 131188, 225917, 389048, 669973, 1153750, 1986854, 3421529, 5892160, 10146793, 17473628, 30091052, 51819313, 89237200, 153673937, 264639398 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`4,1`
	LINKS	`R. H. Hardin, Table of n, a(n) for n=4..500`
	FORMULA	`Conjecture: G.f. -x^4(-13-9x-3x^2+8x^3) / ( 1-x-x^2-x^3+x^4 ). - R. J. Mathar, Nov 28 2011`
	CROSSREFS	`Sequence in context: A164421 A164493 A164509 * A164445 A164418 A164409` `Adjacent sequences: A164412 A164413 A164414 * A164416 A164417 A164418`
	KEYWORD	`nonn`
	AUTHOR	`R. H. Hardin Aug 14 2009`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified December 12 00:45 EST 2013. Contains 233252 sequences.