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.

A248032 Least positive number k such that n + k divides F(n) + F(k), where F(n) denotes the n-th Fibonacci number.

Table of values

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

List of values

[1, 22, 9, 8, 1, 18, 10, 4, 3, 5, 35, 12, 17, 10, 3, 8, 13, 6, 31, 4, 9, 2, 47, 12, 5, 8, 9, 20, 1, 18, 19, 16, 3, 5, 10, 12, 13, 10, 38, 8, 109, 6, 7, 4, 9, 2, 14, 12, 1, 22, 39, 8, 97, 18, 58, 4, 32, 14, 191, 12, 89, 1, 27, 8, 85, 6, 70, 4, 39, 2, 11, 24, 77, 22, 15, 13, 73, 18, 10]