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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204927 The number s(j) such that n divides s(k)-s(j), where s(j) is the (j+1)-st Fibonacci number and k is the least positive integer for which such a j>0 exists. 2
1, 1, 2, 1, 3, 2, 1, 5, 3, 3, 2, 1, 8, 13, 8, 5, 21, 3, 2, 1, 13, 1, 3, 89, 5, 8, 1, 5, 5, 34, 3, 2, 1, 21, 1, 89, 55, 13, 8, 144, 21, 13, 3, 1, 8, 3, 8, 89, 34, 5, 34, 3, 2, 1, 34, 8, 5, 1, 89, 1597 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

For a guide to related sequences, see A204892.

LINKS

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

MATHEMATICA

(See the program at A204924.)

CROSSREFS

Cf. A204924, A204925, A204892, A000045.

Sequence in context: A251722 A304100 A179314 * A119441 A322083 A058399

Adjacent sequences:  A204924 A204925 A204926 * A204928 A204929 A204930

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 21 2012

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 July 8 18:55 EDT 2020. Contains 335524 sequences. (Running on oeis4.)