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.

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

List of values

[0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 2, 0, 0, 2, 1, 2, 1, 1, 1, 2, 2, 2, 3, 1, 1, 4, 2, 3, 4, 3, 3, 3, 3, 4, 6, 5, 4, 6, 4, 5, 7, 6, 7, 8, 8, 8, 9, 7, 8, 11, 11, 11, 13, 12, 12, 15, 12, 14, 17, 15, 18, 19, 20, 20]