login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A220168
Numbers k that divide Fibonacci(k+2).
2
1, 4, 34, 46, 88, 94, 106, 166, 214, 226, 274, 334, 346, 394, 454, 466, 514, 526, 586, 634, 646, 694, 706, 754, 766, 886, 934, 1006, 1114, 1126, 1174, 1186, 1234, 1294, 1306, 1354, 1366, 1486, 1546, 1594, 1654, 1714, 1726, 1774, 1894, 1906, 1954, 1966, 2026
OFFSET
1,2
LINKS
MATHEMATICA
Select[Range[2000], Mod[Fibonacci[#+2], #] == 0 &] (* T. D. Noe, Feb 05 2014 *)
PROG
(Python)
prpr = prev = 1
for i in range(3, 3000):
prpr, prev = prev, prpr+prev
if prev % (i-2) == 0: print(i-2, end=', ')
(PARI) is(n)=((Mod([1, 1; 1, 0], n))^(n+2))[1, 2]==0 \\ Charles R Greathouse IV, Feb 03 2014
CROSSREFS
Cf. A000045.
Cf. A023172 (numbers k that divide Fibonacci(k)).
Cf. A069104 (numbers k that divide Fibonacci(k+1)).
Cf. A123976 (numbers k that divide Fibonacci(k-1)).
Cf. A159051 (numbers k that divide Fibonacci(k-2)).
Sequence in context: A020197 A102959 A057959 * A227397 A365537 A281827
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, May 03 2013
STATUS
approved