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.

A241035 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 0
5 0
6 1
7 0
8 0
9 2
10 0
11 0
12 1
13 1
14 1
15 1
16 0
17 1
18 3
19 1
20 0
21 2
22 1
23 2
24 3
25 2
26 1
27 2
28 2
29 3
30 5
31 2
32 2
33 4
34 3
35 3
36 5
37 5
38 5
39 6
40 3
41 4
42 7
43 6
44 7
45 9
46 7
47 6
48 9
49 8
50 8
51 10
52 10
53 12
54 14
55 11
56 11
57 13
58 13
59 14
60 17
61 16
62 17
63 21
64 18
65 19
66 22
67 20
68 21
69 25
70 25

List of values

[0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 1, 1, 1, 0, 1, 3, 1, 0, 2, 1, 2, 3, 2, 1, 2, 2, 3, 5, 2, 2, 4, 3, 3, 5, 5, 5, 6, 3, 4, 7, 6, 7, 9, 7, 6, 9, 8, 8, 10, 10, 12, 14, 11, 11, 13, 13, 14, 17, 16, 17, 21, 18, 19, 22, 20, 21, 25, 25]