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.

A247937 Least integer m > n such that m + n divides F(m) + F(n), where F(k) refers to the Fibonacci number A000045(k).

Table of values

n a(n)
1 5
2 22
3 9
4 8
5 8
6 18
7 10
8 16
9 21
10 14
11 35
12 24
13 17
14 34
15 21
16 32
17 20
18 30
19 31
20 28
21 87
22 26
23 47
24 36
25 28
26 46
27 63
28 32
29 80
30 42
31 151
32 40
33 75
34 38
35 38
36 60
37 113
38 39
39 51
40 56
41 109
42 49
43 307
44 52
45 63
46 50
47 50
48 72
49 101
50 70
51 57
52 68
53 97
54 66
55 58
56 64
57 93
58 62
59 191
60 84

List of values

[5, 22, 9, 8, 8, 18, 10, 16, 21, 14, 35, 24, 17, 34, 21, 32, 20, 30, 31, 28, 87, 26, 47, 36, 28, 46, 63, 32, 80, 42, 151, 40, 75, 38, 38, 60, 113, 39, 51, 56, 109, 49, 307, 52, 63, 50, 50, 72, 101, 70, 57, 68, 97, 66, 58, 64, 93, 62, 191, 84]