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!)
A205848 The least number j such that 4 divides s(k)-s(j), where k(n)=A205847(n) and s(k) denotes the (k+1)-st Fibonacci number. 4
1, 1, 4, 1, 4, 6, 2, 3, 1, 4, 6, 7, 5, 1, 4, 6, 7, 10, 1, 4, 6, 7, 10, 12, 2, 8, 3, 9, 1, 4, 6, 7, 10, 12, 13, 5, 11, 1, 4, 6, 7, 10, 12, 13, 16, 1, 4, 6, 7, 10, 12, 13, 16, 18, 2, 8, 14, 3, 9, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
For a guide to related sequences, see A205840.
LINKS
EXAMPLE
(See the example at A205847.)
MATHEMATICA
(See the program at A205847.)
CROSSREFS
Sequence in context: A324836 A302151 A167431 * A297701 A110361 A193750
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 March 29 01:34 EDT 2024. Contains 371264 sequences. (Running on oeis4.)