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.

A373013 Number of distinct 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 0
5 1
6 1
7 1
8 3
9 3
10 3
11 5
12 5
13 5
14 8
15 9
16 9
17 13
18 15
19 17
20 23
21 26
22 29
23 36
24 41
25 46
26 57
27 64
28 72
29 87
30 98
31 111
32 131
33 149
34 168
35 197
36 223
37 251
38 291
39 328
40 369
41 423
42 476
43 534
44 609
45 683
46 765
47 867
48 970
49 1084
50 1222
51 1365
52 1522
53 1710
54 1905
55 2121
56 2374
57 2639
58 2931
59 3269
60 3627
61 4020
62 4471
63 4950

List of values

[0, 0, 1, 1, 0, 1, 1, 1, 3, 3, 3, 5, 5, 5, 8, 9, 9, 13, 15, 17, 23, 26, 29, 36, 41, 46, 57, 64, 72, 87, 98, 111, 131, 149, 168, 197, 223, 251, 291, 328, 369, 423, 476, 534, 609, 683, 765, 867, 970, 1084, 1222, 1365, 1522, 1710, 1905, 2121, 2374, 2639, 2931, 3269, 3627, 4020, 4471, 4950]