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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A220168 Numbers n such that n divides Fibonacci(n+2). 2

%I

%S 1,4,34,46,88,94,106,166,214,226,274,334,346,394,454,466,514,526,586,

%T 634,646,694,706,754,766,886,934,1006,1114,1126,1174,1186,1234,1294,

%U 1306,1354,1366,1486,1546,1594,1654,1714,1726,1774,1894,1906,1954,1966,2026

%N Numbers n such that n divides Fibonacci(n+2).

%H Giovanni Resta, <a href="/A220168/b220168.txt">Table of n, a(n) for n = 1..1000</a>

%t Select[Range[2000], Mod[Fibonacci[#+2], #] == 0 &] (* _T. D. Noe_, Feb 05 2014 *)

%o (Python)

%o prpr = prev = 1

%o for i in range(3, 3000):

%o prpr, prev = prev, prpr+prev

%o if prev % (i-2) == 0: print i-2,

%o (PARI) is(n)=((Mod([1,1;1,0],n))^(n+2))[1,2]==0 \\ _Charles R Greathouse IV_, Feb 03 2014

%Y Cf. A023172 (numbers n such that n divides Fibonacci(n)).

%Y Cf. A069104 (numbers n such that n divides Fibonacci(n+1)).

%Y Cf. A123976 (numbers n such that n divides Fibonacci(n-1)).

%Y Cf. A159051 (numbers n such that n divides Fibonacci(n-2)).

%K nonn

%O 1,2

%A _Alex Ratushnyak_, May 03 2013

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.

Last modified September 22 14:20 EDT 2020. Contains 337291 sequences. (Running on oeis4.)