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.

A211353 Refined triangle A211357: T(n,k) is the number of noncrossing partitions up to rotation of an n-set that are of type k (k-th integer partition, defined by A194602).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 3, 4, 6, 3, 5, 1, 2, 1, 1, 1, 1, 3, 5, 10, 5, 15, 3, 5, 6, 3, 1, 3, 1, 1, 1, 1, 4, 7, 19, 10, 35, 7, 19, 21, 12, 4, 21, 7, 7, 1, 3, 4, 4, 1, 1, 1, 1, 1, 4, 10, 28, 14, 70, 14, 48, 56, 28, 10]