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.

A265251 Number of partitions of n such that there is exactly one part which occurs three times, while all other parts occur only once.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 0
5 1
6 2
7 2
8 2
9 4
10 6
11 6
12 9
13 10
14 14
15 19
16 22
17 26
18 35
19 40
20 50
21 63
22 74
23 88
24 107
25 127
26 150
27 181
28 213
29 249
30 296
31 345
32 401
33 473
34 546
35 636
36 741
37 853
38 983
39 1138
40 1306
41 1498
42 1722
43 1967
44 2247
45 2574
46 2925
47 3327
48 3788
49 4294
50 4866
51 5516
52 6233
53 7036
54 7947
55 8953

List of values

[0, 0, 0, 1, 0, 1, 2, 2, 2, 4, 6, 6, 9, 10, 14, 19, 22, 26, 35, 40, 50, 63, 74, 88, 107, 127, 150, 181, 213, 249, 296, 345, 401, 473, 546, 636, 741, 853, 983, 1138, 1306, 1498, 1722, 1967, 2247, 2574, 2925, 3327, 3788, 4294, 4866, 5516, 6233, 7036, 7947, 8953]