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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

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

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

CROSSREFS

Sequence in context: A100808 A010277 A065372 * A136148 A178252 A224850

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

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

Content is available under The OEIS End-User License Agreement .

Last modified August 27 19:53 EDT 2015. Contains 261098 sequences.