id:A027560 - OEIS Search Results

Search: id:A027560

Displaying 1-1 of 1 results found.

page 1

Number of 5-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=5.

+0
2

1, 2, 4, 8, 16, 32, 62, 122, 232, 450, 846, 1622, 3026, 5748, 10664, 20106, 37144, 69608, 128164, 238984, 438826, 814874, 1492908, 2762562, 5051602, 9320014, 17014950, 31311964, 57084732, 104819474, 190865620, 349797128, 636274832 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a_n = a_{n-1} + 5a_{n-2} - 4a_{n-3} - 6a_{n-4} + 3a_{n-5}; g.f. (1+x-3x^2-2x^3+2x^4-x^5) / (1-x-2x^2+x^3)(1-3x^2)`
	CROSSREFS	`Sequence in context: A007813 A005309 A059173 this_sequence A135493 A111663 A054043` `Adjacent sequences: A027557 A027558 A027559 this_sequence A027561 A027562 A027563`
	KEYWORD	`nonn`
	AUTHOR	`R. K. Guy (rkg(AT)cpsc.ucalgary.ca), callan(AT)bayes.stat.wisc.edu (David Callan)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research