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.

A247940 Least integer m > n such that m + n divides L(m) + L(n), where L(k) refers to the Lucas number A000032(k).

Table of values

n a(n)
1 5
2 5
3 15
4 5
5 19
6 30
7 17
8 19
9 15
10 13
11 13
12 24
13 35
14 236
15 33
16 34
17 31
18 90
19 29
20 23
21 27
22 25
23 25
24 84
25 47
26 80
27 45
28 190
29 43
30 54
31 41
32 35
33 39
34 1216
35 37
36 72
37 59
38 212
39 57
40 43
41 55
42 66
43 53
44 86
45 51
46 76
47 49
48 60
49 71
50 53
51 69
52 55
53 67
54 222
55 65
56 122
57 63
58 112
59 61
60 264

List of values

[5, 5, 15, 5, 19, 30, 17, 19, 15, 13, 13, 24, 35, 236, 33, 34, 31, 90, 29, 23, 27, 25, 25, 84, 47, 80, 45, 190, 43, 54, 41, 35, 39, 1216, 37, 72, 59, 212, 57, 43, 55, 66, 53, 86, 51, 76, 49, 60, 71, 53, 69, 55, 67, 222, 65, 122, 63, 112, 61, 264]