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.

A118808 Number of partitions of n having exactly one part with multiplicity 3.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 0
5 1
6 2
7 3
8 3
9 5
10 8
11 13
12 13
13 23
14 28
15 40
16 49
17 71
18 89
19 123
20 147
21 198
22 249
23 329
24 400
25 518
26 642
27 825
28 996
29 1265
30 1545
31 1941
32 2340
33 2920
34 3533
35 4357
36 5233
37 6417
38 7717
39 9399
40 11211
41 13591
42 16215
43 19540
44 23189
45 27826
46 32990
47 39392
48 46504
49 55313
50 65200

List of values

[0, 0, 0, 1, 0, 1, 2, 3, 3, 5, 8, 13, 13, 23, 28, 40, 49, 71, 89, 123, 147, 198, 249, 329, 400, 518, 642, 825, 996, 1265, 1545, 1941, 2340, 2920, 3533, 4357, 5233, 6417, 7717, 9399, 11211, 13591, 16215, 19540, 23189, 27826, 32990, 39392, 46504, 55313, 65200]