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.

A214742 Least m>0 such that L(n)-m divides U(n)+m, where L = A000201 and U = A001950 (lower and upper Wythoff sequences).

Table of values

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

List of values

[1, 3, 2, 1, 1, 10, 4, 13, 2, 2, 9, 10, 20, 3, 3, 26, 10, 29, 4, 4, 12, 36, 13, 5, 20, 42, 43, 35, 6, 49, 49, 52, 7, 7, 20, 28, 21, 8, 8, 65, 23, 68, 9, 9, 72, 75, 75, 10, 10, 39, 29, 84, 11, 11, 31, 91, 32, 12, 95, 97, 98, 48, 13, 50, 104, 107, 14, 14, 39, 91, 40, 15]