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.

A256479 a(1) = 0, and for n > 1, if A079559(n) = 0, then a(n) = 1 + a(A234017(n)), otherwise a(n) = a(A213714(n)-1).

Table of values

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

List of values

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