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.

A068907 Number of partitions of n modulo 3.

Table of values

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

List of values

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