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.

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

Table of values

n a(n)
1 0
2 1
3 0
4 0
5 2
6 1
7 1
8 4
9 1
10 1
11 8
12 3
13 2
14 13
15 5
16 5
17 21
18 9
19 7
20 34
21 13
22 11
23 52
24 23
25 19
26 77
27 32
28 27
29 114
30 51
31 40
32 163
33 72
34 61
35 232
36 106
37 85
38 325
39 146
40 120
41 450
42 210
43 170
44 614
45 284
46 232
47 836
48 395
49 316
50 1120
51 529
52 433
53 1494
54 717
55 576
56 1976
57 946
58 767
59 2599
60 1264

List of values

[0, 1, 0, 0, 2, 1, 1, 4, 1, 1, 8, 3, 2, 13, 5, 5, 21, 9, 7, 34, 13, 11, 52, 23, 19, 77, 32, 27, 114, 51, 40, 163, 72, 61, 232, 106, 85, 325, 146, 120, 450, 210, 170, 614, 284, 232, 836, 395, 316, 1120, 529, 433, 1494, 717, 576, 1976, 946, 767, 2599, 1264]