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.

A133882 a(n) = binomial(n+2,n) mod 2^2.

Table of values

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

List of values

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