A214783 a(n) = smallest k such that n divides Fibonacci(k-1)+3.

1, 2, 1, 2, 4, 5, 13, 6, 17, 15, 7, 9, 19, 29, 17, 8, 23, 17, 15, 15, 13, 17, 12, 9, 18, 47, 41, 45, 11, 17, 27, 18, 17, 23, 77, 21, 10, 15, 25, 18, 25, 29, 34, 27, 17, 12, 21, 21, 13, 18, 33, 75, 59, 41, 17, 45, 33, 11, 14, 57, 35, 27, 45, 18, 75, 17

Offset: 1

Author

Art DuPre, Aug 03 2012

Keywords

• nonn

Examples

			1 divides F(0)+3=3. 2 divides F(1)+3=4. 3 divides F(0)+3=3. 4 divides F(1)+3=4. 5 divides F(3)+3=5.
		

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A157726, A001177, A214781, A214782.

Programs

Maple

A214783 := proc(n)
        local k;
        for k from 0 do
                if modp(combinat[fibonacci](k)+3,n) = 0 then
                        return k;
                end if;
        end do:
end proc:
seq(A214783(n),n=1..80) ; # R. J. Mathar, Aug 08 2012