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.

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

List of values

[0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 2, 1, 0, 1, 2, 1, 2, 0, 1, 3, 2, 2, 2, 1, 2, 4, 4, 2, 3, 2, 3, 6, 4, 4, 6, 4, 4, 5, 6, 8, 8, 7, 6, 8, 7, 8, 12, 10, 10, 13, 12, 11, 12, 12, 14, 18, 18, 17, 18, 18, 18, 22, 20, 22, 26, 25, 28, 30, 29, 30, 32]