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.

A372893 Number of distinct partitions p of n such that max(p) == 0 mod 3.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 1
6 2
7 1
8 1
9 3
10 3
11 4
12 6
13 6
14 7
15 10
16 11
17 12
18 16
19 17
20 20
21 26
22 29
23 34
24 42
25 47
26 54
27 66
28 74
29 85
30 101
31 113
32 129
33 151
34 170
35 193
36 224
37 252
38 286
39 329
40 370
41 418
42 478
43 536
44 603
45 686
46 767
47 862
48 974
49 1088
50 1218
51 1370
52 1527
53 1704
54 1910
55 2124
56 2366
57 2643
58 2934
59 3260
60 3631

List of values

[1, 0, 0, 1, 1, 1, 2, 1, 1, 3, 3, 4, 6, 6, 7, 10, 11, 12, 16, 17, 20, 26, 29, 34, 42, 47, 54, 66, 74, 85, 101, 113, 129, 151, 170, 193, 224, 252, 286, 329, 370, 418, 478, 536, 603, 686, 767, 862, 974, 1088, 1218, 1370, 1527, 1704, 1910, 2124, 2366, 2643, 2934, 3260, 3631]