login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205853 The least number j such that 5 divides s(k)-s(j), where k(n)=A205852(n) and s(k) denotes the (k+1)-st Fibonacci number. 4
3, 3, 5, 1, 4, 8, 8, 10, 3, 5, 6, 2, 4, 9, 2, 13, 2, 13, 15, 8, 10, 11, 1, 7, 4, 9, 14, 1, 7, 18, 1, 7, 18, 20, 2, 13, 15, 16, 3, 5, 6, 12, 4, 9, 14, 19, 3, 5, 6, 12, 23, 3, 5, 6, 12, 23, 25, 1, 7, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

For a guide to related sequences, see A205840.

LINKS

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

EXAMPLE

(See the example at A205852.)

MATHEMATICA

(See the program at A205852.)

CROSSREFS

Cf. A204890, A205852, A205840.

Sequence in context: A091931 A109824 A011399 * A240594 A079887 A131843

Adjacent sequences:  A205850 A205851 A205852 * A205854 A205855 A205856

KEYWORD

nonn

AUTHOR

Clark Kimberling, Feb 02 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 03:13 EDT 2022. Contains 354093 sequences. (Running on oeis4.)