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.

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

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 2
6 3
7 5
8 7
9 9
10 14
11 18
12 25
13 34
14 45
15 58
16 78
17 99
18 128
19 165
20 210
21 264
22 336
23 419
24 525
25 655
26 813
27 1003
28 1242
29 1522
30 1867
31 2283
32 2783
33 3379
34 4105
35 4960
36 5989
37 7214
38 8670
39 10391
40 12447
41 14858
42 17719
43 21088
44 25055
45 29705
46 35187
47 41581
48 49084
49 57844
50 68072
51 79974

List of values

[0, 1, 1, 1, 2, 2, 3, 5, 7, 9, 14, 18, 25, 34, 45, 58, 78, 99, 128, 165, 210, 264, 336, 419, 525, 655, 813, 1003, 1242, 1522, 1867, 2283, 2783, 3379, 4105, 4960, 5989, 7214, 8670, 10391, 12447, 14858, 17719, 21088, 25055, 29705, 35187, 41581, 49084, 57844, 68072, 79974]