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.

A241092 Number of partitions p of n into distinct parts such that max(p) = 1 + 2*(number of parts of p).

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 0
5 0
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 2
14 3
15 3
16 3
17 3
18 4
19 4
20 5
21 7
22 7
23 8
24 9
25 10
26 10
27 12
28 13
29 15
30 17
31 19
32 21
33 25
34 26
35 29
36 32
37 35
38 38
39 42
40 46
41 51
42 57
43 62
44 69
45 76
46 83
47 90
48 100
49 107
50 117
51 127
52 139
53 150
54 165
55 178
56 195
57 212
58 231
59 250
60 273
61 294
62 319
63 346
64 373
65 402

List of values

[0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 7, 7, 8, 9, 10, 10, 12, 13, 15, 17, 19, 21, 25, 26, 29, 32, 35, 38, 42, 46, 51, 57, 62, 69, 76, 83, 90, 100, 107, 117, 127, 139, 150, 165, 178, 195, 212, 231, 250, 273, 294, 319, 346, 373, 402]