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.

A325774 Rectangular array: row n shows the number of parts in all partitions of n that are == k (mod 5), for k = 0, 1, 2, 3, 4.

Table of values

n a(n)
1 0
2 1
3 0
4 0
5 0
6 0
7 2
8 1
9 0
10 0
11 0
12 4
13 1
14 1
15 0
16 0
17 7
18 3
19 1
20 1
21 1
22 12
23 4
24 2
25 1
26 1
27 20
28 8
29 4
30 2
31 2
32 31
33 12
34 6
35 3
36 3
37 47
38 20
39 10
40 6
41 5
42 70
43 28
44 16
45 9
46 9
47 102
48 44
49 23
50 14
51 13
52 147
53 61
54 34
55 20
56 19
57 208
58 91
59 50
60 31
61 28
62 290
63 124
64 71
65 43
66 40
67 400
68 178
69 99
70 63
71 58
72 546

List of values

[0, 1, 0, 0, 0, 0, 2, 1, 0, 0, 0, 4, 1, 1, 0, 0, 7, 3, 1, 1, 1, 12, 4, 2, 1, 1, 20, 8, 4, 2, 2, 31, 12, 6, 3, 3, 47, 20, 10, 6, 5, 70, 28, 16, 9, 9, 102, 44, 23, 14, 13, 147, 61, 34, 20, 19, 208, 91, 50, 31, 28, 290, 124, 71, 43, 40, 400, 178, 99, 63, 58, 546]