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.

A241036 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 1
4 1
5 1
6 3
7 3
8 4
9 6
10 8
11 9
12 12
13 15
14 19
15 23
16 28
17 33
18 42
19 49
20 58
21 70
22 82
23 97
24 115
25 134
26 156
27 182
28 212
29 245
30 285
31 328
32 376
33 434
34 497
35 568
36 651
37 742
38 845
39 962
40 1090
41 1236
42 1401
43 1584
44 1788
45 2019
46 2273
47 2556
48 2875
49 3227
50 3618
51 4055
52 4538
53 5074
54 5670
55 6327

List of values

[0, 0, 0, 1, 1, 1, 3, 3, 4, 6, 8, 9, 12, 15, 19, 23, 28, 33, 42, 49, 58, 70, 82, 97, 115, 134, 156, 182, 212, 245, 285, 328, 376, 434, 497, 568, 651, 742, 845, 962, 1090, 1236, 1401, 1584, 1788, 2019, 2273, 2556, 2875, 3227, 3618, 4055, 4538, 5074, 5670, 6327]