login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214793 a(n)= smallest k>=2 such that n divides Fibonacci(k-1)+13, or 0 if no such k exists.. 1
2, 2, 4, 5, 4, 6, 2, 5, 6, 15, 0, 23, 8, 2, 4, 5, 9, 6, 0, 17, 7, 0, 18, 0, 17, 8, 30, 23, 0, 15, 0, 29, 0, 9, 18, 0, 32, 0, 15, 17, 14, 23, 38, 0, 44, 18, 10, 0, 19, 17, 12, 29, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

CROSSREFS

Cf. A214787, A214788

Sequence in context: A292271 A292593 A332995 * A199088 A293974 A138557

Adjacent sequences:  A214790 A214791 A214792 * A214794 A214795 A214796

KEYWORD

nonn

AUTHOR

Art DuPre, Aug 03 2012

EXTENSIONS

Definition corrected. - R. J. Mathar, Aug 09 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 00:43 EDT 2020. Contains 333238 sequences. (Running on oeis4.)