A015137 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 nontrivial periods of minimal length.

1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 6, 1, 1, 1, 8, 1, 2, 1, 1, 1, 11, 1, 1, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 18, 1, 1, 1, 42, 1, 21, 1, 1, 1, 69, 1, 3, 1, 1, 1, 26, 1, 1, 1, 1, 1, 2, 1, 62, 1, 1, 1, 1, 1, 33, 1, 1, 1, 2, 1, 36, 1, 1, 1, 2, 1, 2, 1, 1, 1, 41, 1, 1, 1, 4, 1, 180, 1, 3, 1, 1, 1, 1, 1, 48, 1, 2, 1

Offset

1,7

Links

Table of n, a(n) for n=1..100.

Crossrefs

Sequence in context: A344764 A359635 A065372 * A368202 A136148 A178252

Adjacent sequences: A015134 A015135 A015136 * A015138 A015139 A015140

Keyword

nonn

Author

Phil Carmody

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005

Status

approved