login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015136 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. 0
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; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The maximal nontrivial periods are the Pisano periods, sequence A001175. - Larry Reeves (larryr(AT)acm.org), Jan 06 2005
LINKS
CROSSREFS
Sequence in context: A084233 A198489 A334503 * A179450 A333287 A360199
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:13 EDT 2024. Contains 371254 sequences. (Running on oeis4.)