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.

A292603 Doudna-tree reduced modulo 4: a(n) = A005940(1+n) mod 4.

Table of values

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

List of values

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