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.

A118082 Number of partitions of n such that largest part k occurs floor(k/2) times.

Table of values

n a(n)
0 1
1 0
2 1
3 2
4 2
5 3
6 3
7 4
8 5
9 6
10 8
11 10
12 12
13 15
14 19
15 22
16 27
17 32
18 39
19 45
20 54
21 63
22 75
23 87
24 102
25 118
26 139
27 160
28 186
29 214
30 248
31 284
32 328
33 375
34 430
35 490
36 561
37 637
38 727
39 824
40 935
41 1058
42 1199
43 1352
44 1528
45 1720
46 1938
47 2177
48 2448
49 2743
50 3079
51 3445
52 3856
53 4307
54 4813
55 5365
56 5985

List of values

[1, 0, 1, 2, 2, 3, 3, 4, 5, 6, 8, 10, 12, 15, 19, 22, 27, 32, 39, 45, 54, 63, 75, 87, 102, 118, 139, 160, 186, 214, 248, 284, 328, 375, 430, 490, 561, 637, 727, 824, 935, 1058, 1199, 1352, 1528, 1720, 1938, 2177, 2448, 2743, 3079, 3445, 3856, 4307, 4813, 5365, 5985]