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.

A214787 a(n) is the smallest k>=2 such that n divides Fibonacci(k-1)+5, or zero if no such k exists.

Table of values

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

List of values

[2, 2, 2, 5, 6, 2, 4, 5, 8, 6, 0, 11, 7, 14, 11, 17, 14, 8, 0, 11, 0, 0, 20, 0, 46, 9, 32, 0, 0, 11, 17, 17, 0, 14, 36, 0, 34, 0, 10, 41, 16, 0, 23, 0, 56, 20, 12, 0, 52, 56, 24, 35, 50, 32, 0, 0, 0, 0, 0, 11, 26, 17, 0, 65]