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.

A211357 Triangle read by rows: T(n,k) is the number of noncrossing partitions up to rotation 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 6
23 9
24 4
25 3
26 0
27 1
28 6
29 15
30 18
31 15
32 5
33 3
34 0
35 1
36 15
37 36
38 56
39 42
40 29
41 7
42 4
43 0
44 1
45 28
46 91
47 144
48 142
49 84
50 42
51 10
52 4
53 0
54 1
55 67
56 232
57 419
58 432
59 322
60 152
61 66
62 12
63 5
64 0
65 1
66 145
67 603
68 1160
69 1365
70 1080
71 630
72 252
73 90
74 15
75 5
76 0
77 1

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, 6, 9, 4, 3, 0, 1, 6, 15, 18, 15, 5, 3, 0, 1, 15, 36, 56, 42, 29, 7, 4, 0, 1, 28, 91, 144, 142, 84, 42, 10, 4, 0, 1, 67, 232, 419, 432, 322, 152, 66, 12, 5, 0, 1, 145, 603, 1160, 1365, 1080, 630, 252, 90, 15, 5, 0, 1]