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.

A241089 Number of partitions p of n into distinct parts such that max(p) > 2*(number of parts of p).

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 1
6 2
7 3
8 4
9 5
10 6
11 8
12 10
13 13
14 16
15 20
16 24
17 29
18 35
19 42
20 50
21 61
22 72
23 85
24 101
25 118
26 138
27 161
28 188
29 218
30 254
31 293
32 339
33 391
34 450
35 515
36 591
37 675
38 771
39 878
40 999
41 1135
42 1289
43 1460
44 1652
45 1868
46 2108
47 2376
48 2676
49 3009
50 3379
51 3793
52 4250
53 4760
54 5325
55 5952

List of values

[0, 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8, 10, 13, 16, 20, 24, 29, 35, 42, 50, 61, 72, 85, 101, 118, 138, 161, 188, 218, 254, 293, 339, 391, 450, 515, 591, 675, 771, 878, 999, 1135, 1289, 1460, 1652, 1868, 2108, 2376, 2676, 3009, 3379, 3793, 4250, 4760, 5325, 5952]