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.

A336121 a(1) = 0, and for n > 1, a(n) = [A122111(n) == 3 (mod 4)] + a(A253553(n)).

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 0, 2, 0, 3, 0, 1, 1, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 1, 2, 0, 1, 0, 1, 0, 1, 0, 3, 1, 2, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 3, 0, 1, 0, 1, 1, 1, 0, 2, 0, 3, 0, 1, 0, 1, 1, 3, 0, 2, 0, 2, 0, 2, 0, 2, 1]