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.

A373012 Number of distinct partitions p of n such that max(p) == 1 mod 3.

Table of values

n a(n)
0 0
1 1
2 0
3 0
4 1
5 1
6 1
7 3
8 2
9 2
10 4
11 3
12 4
13 7
14 7
15 8
16 12
17 13
18 15
19 20
20 21
21 24
22 31
23 34
24 39
25 49
26 54
27 62
28 76
29 84
30 97
31 116
32 130
33 148
34 174
35 195
36 221
37 257
38 287
39 325
40 374
41 419
42 472
43 540
44 604
45 679
46 772
47 861
48 966
49 1092
50 1218
51 1362
52 1533
53 1706
54 1903
55 2133
56 2368
57 2635
58 2943
59 3263
60 3622
61 4033
62 4463

List of values

[0, 1, 0, 0, 1, 1, 1, 3, 2, 2, 4, 3, 4, 7, 7, 8, 12, 13, 15, 20, 21, 24, 31, 34, 39, 49, 54, 62, 76, 84, 97, 116, 130, 148, 174, 195, 221, 257, 287, 325, 374, 419, 472, 540, 604, 679, 772, 861, 966, 1092, 1218, 1362, 1533, 1706, 1903, 2133, 2368, 2635, 2943, 3263, 3622, 4033, 4463]