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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 1
6 2
7 3
8 4
9 4
10 8
11 9
12 11
13 14
14 18
15 22
16 28
17 32
18 39
19 48
20 58
21 68
22 81
23 95
24 112
25 132
26 155
27 180
28 210
29 242
30 280
31 326
32 374
33 430
34 494
35 565
36 646
37 737
38 840
39 956
40 1087
41 1232
42 1394
43 1578
44 1781
45 2010
46 2266
47 2550
48 2866
49 3219
50 3610
51 4045
52 4528
53 5062
54 5656
55 6316

List of values

[0, 0, 0, 0, 1, 1, 2, 3, 4, 4, 8, 9, 11, 14, 18, 22, 28, 32, 39, 48, 58, 68, 81, 95, 112, 132, 155, 180, 210, 242, 280, 326, 374, 430, 494, 565, 646, 737, 840, 956, 1087, 1232, 1394, 1578, 1781, 2010, 2266, 2550, 2866, 3219, 3610, 4045, 4528, 5062, 5656, 6316]