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.

A275720 a(1) = 0; for n > 1, if A003961(n) > A003961(n-1) then a(n) = a(n-1) + 1, otherwise if A003961(n) < A003961(n-1), then a(n) = a(n-1) - 1.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 2
6 3
7 2
8 3
9 2
10 1
11 0
12 1
13 0
14 1
15 2
16 3
17 2
18 3
19 2
20 3
21 2
22 1
23 0
24 1
25 0
26 1
27 2
28 1
29 0
30 1
31 0
32 1
33 0
34 -1
35 0
36 1
37 0
38 1
39 2
40 3
41 2
42 3
43 2
44 3
45 4
46 3
47 2
48 3
49 2
50 3
51 2
52 3
53 2
54 3
55 2
56 3
57 2
58 1
59 0
60 1
61 0
62 1
63 2
64 3
65 2
66 3
67 2
68 3
69 2
70 3
71 2
72 3
73 2
74 3
75 4
76 3
77 2
78 3
79 2
80 3
81 4
82 3
83 2
84 3
85 2
86 3
87 4
88 5
89 4
90 5
91 4
92 5
93 4
94 3
95 4
96 5
97 4
98 5
99 4
100 5
101 4
102 5
103 4
104 5
105 4
106 3
107 2
108 3
109 2
110 3
111 2
112 3
113 2
114 3
115 2
116 3
117 4
118 3
119 4
120 5

List of values

[0, 1, 2, 3, 2, 3, 2, 3, 2, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 4, 5, 4, 5, 4, 5, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 4, 5]