A214781 - OEIS

A214781

a(n) = smallest k>=2 such that n divides Fibonacci(k-1)+2

2, 4, 2, 4, 5, 10, 6, 0, 10, 7, 0, 10, 12, 22, 8, 0, 16, 10, 11, 28, 0, 0, 9, 0, 48, 40, 34, 22, 0, 34, 0, 0, 0, 16, 28, 10, 36, 0, 18, 0, 18, 0, 17, 0, 34, 22, 14, 0, 54, 148, 16, 40, 52, 34, 0, 0, 11, 0, 0, 34, 28, 0, 0, 0, 68, 0, 21, 16

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

0 is inserted if no such k exists.

LINKS

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

EXAMPLE

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

PROG

(PARI) a(n) = {k = 2; while (((fibonacci(k-1)+2) % n), k++; if (k > 6*n+2 , return(0)); ); return (k); } \\ Michel Marcus, May 30 2013

CROSSREFS

Cf. A157725, A001177, A214782.

Sequence in context: A116982 A216621 A300448 * A214850 A236186 A143271

Adjacent sequences: A214778 A214779 A214780 * A214782 A214783 A214784

KEYWORD

nonn

AUTHOR

Art DuPre, Aug 03 2012

STATUS

approved