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.

A302062 a(n) is the smallest nonnegative k such that n + k divides Fibonacci(n) + k, or -1 if no such k exists.

Table of values

n a(n)
0 1
1 0
2 -1
3 -1
4 -1
5 0
6 -1
7 -1
8 5
9 16
10 5
11 2
12 0
13 7
14 19
15 2
16 955
17 3
18 1265
19 2062
20 51
21 2
22 27
23 80
24 0
25 0
26 121341
27 15080
28 317755
29 1
30 8
31 27
32 867
33 122
34 5
35 2
36 0
37 312
38 13029339
39 6680
40 25
41 2
42 40
43 39
44 35
45 2
46 4537
47 15
48 0
49 1
50 95
51 2
52 67
53 7
54 8
55 15
56 32264490467
57 58
58 489
59 3108
60 0
61 22
62 1
63 116
64 973
65 2
66 125
67 19
68 143

List of values

[1, 0, -1, -1, -1, 0, -1, -1, 5, 16, 5, 2, 0, 7, 19, 2, 955, 3, 1265, 2062, 51, 2, 27, 80, 0, 0, 121341, 15080, 317755, 1, 8, 27, 867, 122, 5, 2, 0, 312, 13029339, 6680, 25, 2, 40, 39, 35, 2, 4537, 15, 0, 1, 95, 2, 67, 7, 8, 15, 32264490467, 58, 489, 3108, 0, 22, 1, 116, 973, 2, 125, 19, 143]