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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 4
9 4
10 6
11 8
12 11
13 13
14 16
15 21
16 26
17 32
18 38
19 45
20 56
21 66
22 79
23 94
24 110
25 128
26 151
27 178
28 207
29 240
30 277
31 320
32 370
33 426
34 488
35 561
36 642
37 732
38 834
39 948
40 1079
41 1225
42 1388
43 1570
44 1774
45 2002
46 2254
47 2540
48 2856
49 3206
50 3598
51 4034
52 4516
53 5050
54 5642
55 6298

List of values

[0, 0, 0, 0, 0, 1, 1, 2, 4, 4, 6, 8, 11, 13, 16, 21, 26, 32, 38, 45, 56, 66, 79, 94, 110, 128, 151, 178, 207, 240, 277, 320, 370, 426, 488, 561, 642, 732, 834, 948, 1079, 1225, 1388, 1570, 1774, 2002, 2254, 2540, 2856, 3206, 3598, 4034, 4516, 5050, 5642, 6298]