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.

A211351 Refined triangle A091867: T(n,k) is the number of noncrossing partitions 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 3
6 1
7 1
8 6
9 4
10 2
11 1
12 1
13 10
14 10
15 10
16 5
17 5
18 1
19 1
20 15
21 20
22 30
23 15
24 30
25 6
26 5
27 6
28 3
29 1
30 1
31 21
32 35
33 70
34 35
35 105
36 21
37 35
38 42
39 21
40 7
41 21
42 7
43 7
44 1
45 1
46 28
47 56
48 140
49 70
50 280
51 56
52 140
53 168
54 84
55 28
56 168
57 56
58 56
59 8
60 14
61 28
62 28
63 8
64 8
65 4
66 1

List of values

[1, 1, 1, 1, 3, 1, 1, 6, 4, 2, 1, 1, 10, 10, 10, 5, 5, 1, 1, 15, 20, 30, 15, 30, 6, 5, 6, 3, 1, 1, 21, 35, 70, 35, 105, 21, 35, 42, 21, 7, 21, 7, 7, 1, 1, 28, 56, 140, 70, 280, 56, 140, 168, 84, 28, 168, 56, 56, 8, 14, 28, 28, 8, 8, 4, 1]

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

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