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.

A068908 Number of partitions of n modulo 5.

Table of values

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

List of values

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