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.

A211359 Triangle read by rows: T(n,k) is the number of noncrossing partitions up to rotation and reflection of an n-set that contain k singleton blocks.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 1
7 1
8 0
9 1
10 2
11 1
12 2
13 0
14 1
15 2
16 3
17 2
18 2
19 0
20 1
21 5
22 4
23 8
24 3
25 3
26 0
27 1
28 6
29 11
30 12
31 12
32 4
33 3
34 0
35 1
36 14
37 21
38 39
39 24
40 22
41 5
42 4
43 0
44 1
45 22
46 55
47 84
48 85
49 48
50 30
51 7
52 4
53 0
54 1
55 51
56 124
57 245
58 228
59 190
60 82
61 46
62 8
63 5
64 0
65 1
66 95
67 327
68 620
69 730
70 570
71 350
72 136
73 60

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 2, 0, 1, 2, 3, 2, 2, 0, 1, 5, 4, 8, 3, 3, 0, 1, 6, 11, 12, 12, 4, 3, 0, 1, 14, 21, 39, 24, 22, 5, 4, 0, 1, 22, 55, 84, 85, 48, 30, 7, 4, 0, 1, 51, 124, 245, 228, 190, 82, 46, 8, 5, 0, 1, 95, 327, 620, 730, 570, 350, 136, 60]