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.

A239513 Number of partitions p of n such that if h = (number of parts of p), then h is an (h,0)-separator of p; see Comments.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 1
8 1
9 2
10 2
11 3
12 3
13 5
14 5
15 7
16 8
17 9
18 10
19 12
20 13
21 15
22 17
23 19
24 21
25 25
26 27
27 31
28 35
29 40
30 44
31 50
32 55
33 62
34 68
35 76
36 83
37 93
38 101
39 112
40 122
41 136
42 147
43 163
44 177
45 196
46 213
47 235
48 255
49 281
50 305
51 335
52 363
53 398
54 431
55 471
56 510
57 556
58 601
59 654
60 706
61 768
62 828

List of values

[0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 25, 27, 31, 35, 40, 44, 50, 55, 62, 68, 76, 83, 93, 101, 112, 122, 136, 147, 163, 177, 196, 213, 235, 255, 281, 305, 335, 363, 398, 431, 471, 510, 556, 601, 654, 706, 768, 828]