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.

A068909 Number of partitions of n modulo 7.

Table of values

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

List of values

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