id:A015136 - OEIS Search Results

Search: id:A015136

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 minimal nontrivial period length.

+0
1

1, 3, 8, 3, 4, 3, 16, 3, 8, 3, 5, 3, 28, 3, 4, 3, 36, 3, 9, 3, 8, 3, 48, 3, 4, 3, 8, 3, 7, 3, 15, 3, 5, 3, 4, 3, 76, 3, 8, 3, 40, 3, 88, 3, 4, 3, 32, 3, 16, 3, 8, 3, 108, 3, 4, 3, 8, 3, 29, 3, 60, 3, 8, 3, 4, 3, 136, 3, 8, 3, 35, 3, 148, 3, 4, 3, 5, 3, 39, 3, 8, 3, 168, 3, 4, 3, 7, 3, 44, 3, 16, 3, 8, 3 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The maximal nontrivial period lengths are the Pisano periods, sequence A001175. - Larry Reeves (larryr(AT)acm.org), Jan 06 2005`
	CROSSREFS	`Sequence in context: A021265 A115369 A084233 this_sequence A117240 A151857 A010706` `Adjacent sequences: A015133 A015134 A015135 this_sequence A015137 A015138 A015139`
	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 November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research