cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A220168 Numbers k that divide Fibonacci(k+2).

Original entry on oeis.org

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

Views

Author

Alex Ratushnyak, May 03 2013

Keywords

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)).

Programs

  • Mathematica
    Select[Range[2000], Mod[Fibonacci[#+2], #] == 0 &] (* T. D. Noe, Feb 05 2014 *)
  • PARI
    is(n)=((Mod([1,1;1,0],n))^(n+2))[1,2]==0 \\ Charles R Greathouse IV, Feb 03 2014
  • Python
    prpr = prev = 1
    for i in range(3, 3000):
        prpr, prev = prev, prpr+prev
        if prev % (i-2) == 0:  print(i-2, end=', ')