A047874 - cp's OEIS frontend

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

n	a(n)
1	1
2	1
3	1
4	1
5	4
6	1
7	1
8	13
9	9
10	1
11	1
12	41
13	61
14	16
15	1
16	1
17	131
18	381
19	181
20	25
21	1
22	1
23	428
24	2332
25	1821
26	421
27	36
28	1
29	1
30	1429
31	14337
32	17557
33	6105
34	841
35	49
36	1
37	1
38	4861
39	89497
40	167449
41	83029
42	16465
43	1513
44	64
45	1
46	1
47	16795
48	569794
49	1604098
50	1100902
51	296326
52	38281
53	2521
54	81
55	1

[1, 1, 1, 1, 4, 1, 1, 13, 9, 1, 1, 41, 61, 16, 1, 1, 131, 381, 181, 25, 1, 1, 428, 2332, 1821, 421, 36, 1, 1, 1429, 14337, 17557, 6105, 841, 49, 1, 1, 4861, 89497, 167449, 83029, 16465, 1513, 64, 1, 1, 16795, 569794, 1604098, 1100902, 296326, 38281, 2521, 81, 1]

cp's OEIS Frontend

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

Table of values

List of values