login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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 length. 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 period lengths are the Pisano periods, sequence A001175. - Larry Reeves (larryr(AT)acm.org), Jan 06 2005

LINKS

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

CROSSREFS

Sequence in context: A115369 A084233 A198489 * A179450 A117240 A151857

Adjacent sequences:  A015133 A015134 A015135 * A015137 A015138 A015139

KEYWORD

nonn

AUTHOR

Phil Carmody

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 07:41 EST 2016. Contains 278761 sequences.