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!)
A214793 a(n)= smallest k>=2 such that n divides Fibonacci(k-1)+13, or 0 if no such k exists.. 1

%I #15 Aug 09 2012 11:18:58

%S 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,

%T 0,29,0,9,18,0,32,0,15,17,14,23,38,0,44,18,10,0,19,17,12,29,19

%N a(n)= smallest k>=2 such that n divides Fibonacci(k-1)+13, or 0 if no such k exists..

%Y Cf. A214787, A214788

%K nonn

%O 1,1

%A _Art DuPre_, Aug 03 2012

%E Definition corrected. - _R. J. Mathar_, Aug 09 2012

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 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)