id:A131600 - OEIS Search Results

Search: id:A131600

Displaying 1-1 of 1 results found.

page 1

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 a block of length at least m made of first symbols. 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

19, 37, 55, 397, 1063, 2053, 9199, 28333, 65287, 230869, 740863, 1916029 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n+1)/a(n) -> 3.`
	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=19, m=2.` `G.f.: -x(19+18x+18x^2)/(3x-1)/(6x^2+2*x+1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 14 2007`
	CROSSREFS	`Cf. A000045, A000930.` `Sequence in context: A139313 A109639 A161705 this_sequence A162471 A124268 A154944` `Adjacent sequences: A131597 A131598 A131599 this_sequence A131601 A131602 A131603`
	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 November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research