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.

A239516 Number of partitions p of n that are separable by the 2*min(p); see Comments.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 3
7 2
8 4
9 6
10 6
11 8
12 12
13 14
14 16
15 22
16 27
17 32
18 41
19 49
20 60
21 73
22 88
23 106
24 130
25 154
26 184
27 220
28 262
29 313
30 373
31 440
32 520
33 616
34 723
35 849
36 1002
37 1173
38 1373
39 1606
40 1873
41 2182
42 2543
43 2955
44 3431
45 3979
46 4608
47 5327
48 6160
49 7105
50 8190
51 9435
52 10851
53 12469
54 14317

List of values

[0, 0, 1, 1, 1, 3, 2, 4, 6, 6, 8, 12, 14, 16, 22, 27, 32, 41, 49, 60, 73, 88, 106, 130, 154, 184, 220, 262, 313, 373, 440, 520, 616, 723, 849, 1002, 1173, 1373, 1606, 1873, 2182, 2543, 2955, 3431, 3979, 4608, 5327, 6160, 7105, 8190, 9435, 10851, 12469, 14317]