id:A131601 - OEIS Search Results

Search: id:A131601

Displaying 1-1 of 1 results found.

page 1

The number of different configurations of an n-block of a shift space with k symbols where each symbol but the first must appear isolated and separated from others by an block of length at least m made of first symbol For k=2 is the number of different configurations of an n-bits string where each 1 is isolated and separated by at least m zeros.

+0
1

49, 97, 145, 2497, 7153, 14113, 133969, 477313, 1154737, 7585249, 30496273 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n+1)/a(n) -> 4.`
	REFERENCES	`math:archiv:0708.4370`
	LINKS	`R. Tonelli, Fibonacci-like sequences and shift spaces.`
	FORMULA	`a(n) = a(n-1) + (k-1)a(n-m-1), where k=49, m=2` `G.f.: -x(49+48x+48x^2)/(4x-1)/(12x^2+3*x+1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 14 2007`
	CROSSREFS	`Cf. A000045, A000930.` `Sequence in context: A043250 A044030 A165339 this_sequence A044138 A043394 A044519` `Adjacent sequences: A131598 A131599 A131600 this_sequence A131602 A131603 A131604`
	KEYWORD	`easy,nonn`
	AUTHOR	`R. Tonelli (roberto.tonelli(AT)dsf.unica.it), Aug 31 2007`

page 1

Search completed in 0.002 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research