A366503 - cp's OEIS frontend

A366503 Triangle read by rows: T(n,k) = number of permutations of (1, 2, ..., n) with longest monotonic subsequence of length k (1<=k<=n).

n	a(n)
1	1
2	0
3	2
4	0
5	4
6	2
7	0
8	4
9	18
10	2
11	0
12	0
13	86
14	32
15	2
16	0
17	0
18	306
19	362
20	50
21	2
22	0
23	0
24	882
25	3242
26	842
27	72
28	2
29	0
30	0
31	1764
32	24564
33	12210
34	1682
35	98
36	2
37	0
38	0
39	1764
40	163872
41	161158
42	32930
43	3026
44	128
45	2
46	0
47	0
48	0
49	985032
50	1969348
51	592652
52	76562
53	5042
54	162
55	2

[1, 0, 2, 0, 4, 2, 0, 4, 18, 2, 0, 0, 86, 32, 2, 0, 0, 306, 362, 50, 2, 0, 0, 882, 3242, 842, 72, 2, 0, 0, 1764, 24564, 12210, 1682, 98, 2, 0, 0, 1764, 163872, 161158, 32930, 3026, 128, 2, 0, 0, 0, 985032, 1969348, 592652, 76562, 5042, 162, 2]

cp's OEIS Frontend

A366503 Triangle read by rows: T(n,k) = number of permutations of (1, 2, ..., n) with longest monotonic subsequence of length k (1<=k<=n).

Table of values

List of values