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.

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

Table of values

n a(n)
1 0
2 1
3 0
4 0
5 0
6 2
7 1
8 0
9 0
10 4
11 1
12 1
13 1
14 7
15 3
16 1
17 1
18 13
19 4
20 2
21 2
22 20
23 9
24 4
25 3
26 32
27 12
28 7
29 7
30 48
31 21
32 10
33 9
34 73
35 29
36 17
37 15
38 106
39 47
40 24
41 21
42 153
43 64
44 37
45 34
46 215
47 97
48 53
49 46
50 303
51 131
52 76
53 68
54 416
55 190
56 106
57 92
58 571
59 254
60 151
61 134
62 770
63 355
64 204
65 178
66 1037

List of values

[0, 1, 0, 0, 0, 2, 1, 0, 0, 4, 1, 1, 1, 7, 3, 1, 1, 13, 4, 2, 2, 20, 9, 4, 3, 32, 12, 7, 7, 48, 21, 10, 9, 73, 29, 17, 15, 106, 47, 24, 21, 153, 64, 37, 34, 215, 97, 53, 46, 303, 131, 76, 68, 416, 190, 106, 92, 571, 254, 151, 134, 770, 355, 204, 178, 1037]