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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204929 (s(k(n))-s(j(n)))/n, where (s(k(n)), s(j(n))) is the least pair of distinct Fibonacci numbers for which n divides s(k(n))-s(j(n)). 3
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 15, 1, 2, 1, 1, 1, 1, 4, 10, 6, 2, 1, 2, 3, 1, 85, 1, 1, 1, 1, 506, 4, 15, 2, 107, 61, 3, 1, 2, 2, 5, 5, 1, 3, 7, 1, 50, 1, 1, 1, 1, 46, 4, 4, 2056, 451 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,9

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, A204892, A204928.

Sequence in context: A039754 A213919 A062277 * A118210 A061399 A161856

Adjacent sequences:  A204926 A204927 A204928 * A204930 A204931 A204932

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 October 19 21:01 EDT 2019. Contains 328225 sequences. (Running on oeis4.)