A047887 - cp's OEIS frontend

A047887 Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).

n	a(n)
1	1
2	1
3	2
4	1
5	5
6	6
7	1
8	14
9	23
10	24
11	1
12	42
13	103
14	119
15	120
16	1
17	132
18	513
19	694
20	719
21	720
22	1
23	429
24	2761
25	4582
26	5003
27	5039
28	5040
29	1
30	1430
31	15767
32	33324
33	39429
34	40270
35	40319
36	40320
37	1
38	4862
39	94359
40	261808
41	344837
42	361302
43	362815
44	362879
45	362880
46	1
47	16796

[1, 1, 2, 1, 5, 6, 1, 14, 23, 24, 1, 42, 103, 119, 120, 1, 132, 513, 694, 719, 720, 1, 429, 2761, 4582, 5003, 5039, 5040, 1, 1430, 15767, 33324, 39429, 40270, 40319, 40320, 1, 4862, 94359, 261808, 344837, 361302, 362815, 362879, 362880, 1, 16796]

cp's OEIS Frontend

A047887 Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).

Table of values

List of values