id:A019310 - OEIS Search Results

Search: id:A019310

Displaying 1-1 of 1 results found.

page 1

A019310

Number of words of length n (n >= 1) over a two-letter alphabet having a minimal period of size n-1.

+0
1

0, 2, 2, 6, 10, 22, 38, 82, 154, 318, 614, 1250, 2462, 4962, 9842, 19766, 39378, 78910, 157502, 315322, 630030, 1260674, 2520098, 5041446, 10080430, 20163322, 40321682, 80648326, 161286810, 322583462, 645147158, 1290314082, 2580588786, 5161216950 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`H. Harborth, Endliche 0-1-Folgen mit gleichen Teilbl\"ocken, J. f\"ur Reine Angewandte Math. 271 (1974), 139-154.`
	FORMULA	`a(n) = 2a(n-1) + (-1)^n a(ceiling(n/2)) for n >= 2.`
	CROSSREFS	`Sequence in context: A054228 A044044 A123757 this_sequence A014113 A078008 A076907` `Adjacent sequences: A019307 A019308 A019309 this_sequence A019311 A019312 A019313`
	KEYWORD	`nonn`
	AUTHOR	`Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research