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.

A214741 Least m>0 such that n-m divides L(n)+m, where L = A000201 (lower Wythoff sequence).

Table of values

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

List of values

[1, 2, 2, 4, 1, 1, 3, 8, 8, 4, 11, 11, 2, 2, 15, 6, 17, 12, 7, 3, 3, 3, 22, 12, 9, 13, 27, 4, 4, 4, 31, 31, 33, 22, 34, 5, 5, 5, 14, 40, 41, 15, 21, 6, 6, 6, 23, 17, 24, 32, 18, 7, 7, 42, 54, 56, 57, 37, 59, 8, 8, 22, 63, 31, 23, 32, 66, 9, 9, 34, 25, 72, 73, 26, 10, 10, 10]