The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS CROSSREFS Sequence in context: A100808 A010277 A065372 * A136148 A178252 A325498 Adjacent sequences:  A015134 A015135 A015136 * A015138 A015139 A015140 KEYWORD nonn AUTHOR EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 25 23:08 EST 2020. Contains 331270 sequences. (Running on oeis4.)