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!)
A205843 The least number j such that 3 divides s(k)-s(j), where k(n)=A205842(n) and s(k) denotes the (k+1)-st Fibonacci number. 4
2, 2, 4, 1, 3, 1, 6, 1, 6, 8, 2, 4, 5, 3, 7, 2, 4, 5, 10, 2, 4, 5, 10, 12, 1, 6, 8, 9, 3, 7, 11, 1, 6, 8, 9, 14, 1, 6, 8, 9, 14, 16, 2, 4, 5, 10, 12, 13, 3, 7, 11, 15, 2, 4, 5, 10, 12, 13, 18, 2 (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 A205842.)
MATHEMATICA
(See the program at A205842.)
CROSSREFS
Sequence in context: A333335 A212791 A175001 * A171727 A171942 A264799
KEYWORD
nonn
AUTHOR
Clark Kimberling, Feb 01 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 April 19 16:21 EDT 2024. Contains 371794 sequences. (Running on oeis4.)