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.

A373015 Number of partitions p of n such that max(p) == 2 mod 3.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 3
6 4
7 5
8 8
9 10
10 14
11 19
12 25
13 33
14 45
15 58
16 76
17 99
18 127
19 162
20 209
21 263
22 333
23 419
24 524
25 652
26 813
27 1003
28 1239
29 1524
30 1868
31 2281
32 2786
33 3382
34 4104
35 4965
36 5993
37 7213
38 8676
39 10396
40 12447
41 14866
42 17725
43 21087
44 25063
45 29711
46 35185
47 41589
48 49089
49 57839
50 68079

List of values

[0, 0, 1, 1, 2, 3, 4, 5, 8, 10, 14, 19, 25, 33, 45, 58, 76, 99, 127, 162, 209, 263, 333, 419, 524, 652, 813, 1003, 1239, 1524, 1868, 2281, 2786, 3382, 4104, 4965, 5993, 7213, 8676, 10396, 12447, 14866, 17725, 21087, 25063, 29711, 35185, 41589, 49089, 57839, 68079]