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!)
A205878 The least number j such that 10 divides s(k)-s(j), where k(n)=A205877(n) and s(k) denotes the (k+1)-st Fibonacci number. 4
3, 1, 4, 8, 3, 6, 13, 13, 15, 8, 11, 1, 7, 4, 9, 1, 7, 18, 13, 15, 16, 5, 4, 9, 19, 3, 6, 12, 5, 23, 1, 7, 18, 21, 10, 14, 10, 28, 10, 28, 30, 5, 23, 26, 13, 15, 16, 22, 4, 9 (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 A205877.)
MATHEMATICA
(See the program at A205877.)
CROSSREFS
Sequence in context: A210739 A193605 A193667 * A329130 A057049 A245672
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 28 07:20 EDT 2024. Contains 371235 sequences. (Running on oeis4.)