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.

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

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 5
6 7
7 11
8 16
9 23
10 33
11 46
12 63
13 86
14 116
15 153
16 203
17 265
18 345
19 444
20 571
21 727
22 925
23 1166
24 1468
25 1836
26 2293
27 2845
28 3525
29 4345
30 5347
31 6550
32 8011
33 9758
34 11867
35 14380
36 17399
37 20984
38 25269
39 30341
40 36376
41 43500
42 51943
43 61877
44 73608
45 87373
46 103571

List of values

[0, 1, 2, 3, 5, 7, 11, 16, 23, 33, 46, 63, 86, 116, 153, 203, 265, 345, 444, 571, 727, 925, 1166, 1468, 1836, 2293, 2845, 3525, 4345, 5347, 6550, 8011, 9758, 11867, 14380, 17399, 20984, 25269, 30341, 36376, 43500, 51943, 61877, 73608, 87373, 103571]