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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015138 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 maximal length periods. 0
1, 1, 1, 2, 1, 1, 3, 4, 3, 1, 11, 5, 6, 3, 4, 8, 8, 13, 19, 5, 27, 11, 11, 21, 5, 6, 9, 15, 58, 4, 31, 16, 24, 32, 12, 53, 18, 76, 24, 21, 42, 27, 21, 59, 12, 44, 69, 93, 21, 5, 32, 30, 26, 36, 145, 63, 40, 58, 59, 20, 62, 124, 72, 32, 24, 24, 33, 128, 99, 12, 71, 213, 36, 18, 20, 316 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

CROSSREFS

Sequence in context: A055068 A237498 A319516 * A157807 A100529 A262953

Adjacent sequences:  A015135 A015136 A015137 * A015139 A015140 A015141

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 16:39 EDT 2019. Contains 328120 sequences. (Running on oeis4.)