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.

A239456 Number of partitions p of n such that if h = max(p), then h is an (h,2)-separator of p; see Comments.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 1
8 2
9 1
10 1
11 4
12 2
13 3
14 4
15 4
16 5
17 7
18 5
19 7
20 9
21 9
22 9
23 14
24 11
25 13
26 16
27 17
28 19
29 22
30 20
31 25
32 28
33 29
34 30
35 38
36 37
37 41
38 45
39 48
40 51
41 60
42 59
43 67
44 73
45 76
46 82
47 93
48 94
49 103
50 111
51 121
52 127
53 142
54 143
55 158
56 171
57 180
58 191
59 211
60 218
61 236
62 252
63 270
64 284
65 309
66 320

List of values

[0, 0, 0, 0, 1, 0, 1, 2, 1, 1, 4, 2, 3, 4, 4, 5, 7, 5, 7, 9, 9, 9, 14, 11, 13, 16, 17, 19, 22, 20, 25, 28, 29, 30, 38, 37, 41, 45, 48, 51, 60, 59, 67, 73, 76, 82, 93, 94, 103, 111, 121, 127, 142, 143, 158, 171, 180, 191, 211, 218, 236, 252, 270, 284, 309, 320]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.