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!)
A205858 The least number j such that 6 divides s(k)-s(j), where k(n)=A205857(n) and s(k) denotes the (k+1)-st Fibonacci number. 4
2, 1, 3, 1, 6, 4, 4, 10, 4, 10, 12, 8, 3, 7, 1, 6, 9, 8, 14, 4, 10, 12, 13, 3, 7, 15, 2, 5, 4, 10, 12, 13, 18, 1, 6, 9, 16, 11, 1, 6, 9, 16, 22, 1, 6, 9, 16, 22, 24, 2, 5, 20, 3, 7, 15, 19, 4, 10, 12, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For a guide to related sequences, see A205840.
LINKS
EXAMPLE
(See the example at A205857.)
MATHEMATICA
(See the program at A205857.)
CROSSREFS
Sequence in context: A282601 A363273 A034869 * A340793 A053222 A351159
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 8 23:08 EDT 2024. Contains 372341 sequences. (Running on oeis4.)