id:A015138 - OEIS Search Results

Search: id:A015138

Displaying 1-1 of 1 results found.

page 1

Consider Fibonacci-type sequences b(0)=X, b(1)=Y, b(k)=b(k-1)+b(k-2) mod n; all are periodic; sequence gives number of maximal length periods.

+0
1

1, 1, 1, 2, 1, 1, 3, 4, 3, 1, 11, 5, 6, 3, 4, 8, 8, 13, 19, 5, 27, 11, 11, 21, 5, 6, 9, 15, 58, 4, 31, 16, 24, 32, 12, 53, 18, 76, 24, 21, 42, 27, 21, 59, 12, 44, 69, 93, 21, 5, 32, 30, 26, 36, 145, 63, 40, 58, 59, 20, 62, 124, 72, 32, 24, 24, 33, 128, 99, 12, 71, 213, 36, 18, 20, 316 (list; graph; listen)

	OFFSET	`1,4`
	CROSSREFS	`Sequence in context: A025564 A052265 A055068 this_sequence A157807 A100529 A124424` `Adjacent sequences: A015135 A015136 A015137 this_sequence A015139 A015140 A015141`
	KEYWORD	`nonn`
	AUTHOR	`Phil Carmody (pc+oeis(AT)asdf.org)`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research