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.

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

Table of values

n a(n)
1 2
2 4
3 2
4 4
5 5
6 10
7 6
8 0
9 10
10 7
11 0
12 10
13 12
14 22
15 8
16 0
17 16
18 10
19 11
20 28
21 0
22 0
23 9
24 0
25 48
26 40
27 34
28 22
29 0
30 34
31 0
32 0
33 0
34 16
35 28
36 10
37 36
38 0
39 18
40 0
41 18
42 0
43 17
44 0
45 34
46 22
47 14
48 0
49 54
50 148
51 16
52 40
53 52
54 34
55 0
56 0
57 11
58 0
59 0
60 34
61 28
62 0
63 0
64 0
65 68
66 0
67 21
68 16

List of values

[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]