A321316 - cp's OEIS frontend

A321316 Number T(n,k) of permutations of [n] whose difference between the length of the longest increasing subsequence and the length of the longest decreasing subsequence equals k; triangle T(n,k), n >= 1, 1-n <= k <= n-1, read by rows.

n	a(n)
1	1
2	1
3	0
4	1
5	1
6	0
7	4
8	0
9	1
10	1
11	0
12	9
13	4
14	9
15	0
16	1
17	1
18	0
19	16
20	25
21	36
22	25
23	16
24	0
25	1
26	1
27	0
28	25
29	81
30	125
31	256
32	125
33	81
34	25
35	0
36	1
37	1
38	0
39	36
40	196
41	421
42	1225
43	1282
44	1225
45	421
46	196
47	36
48	0
49	1
50	1
51	0
52	49
53	400
54	1225
55	4292
56	9261
57	9864
58	9261
59	4292
60	1225
61	400
62	49
63	0
64	1

[1, 1, 0, 1, 1, 0, 4, 0, 1, 1, 0, 9, 4, 9, 0, 1, 1, 0, 16, 25, 36, 25, 16, 0, 1, 1, 0, 25, 81, 125, 256, 125, 81, 25, 0, 1, 1, 0, 36, 196, 421, 1225, 1282, 1225, 421, 196, 36, 0, 1, 1, 0, 49, 400, 1225, 4292, 9261, 9864, 9261, 4292, 1225, 400, 49, 0, 1]

cp's OEIS Frontend

A321316 Number T(n,k) of permutations of [n] whose difference between the length of the longest increasing subsequence and the length of the longest decreasing subsequence equals k; triangle T(n,k), n >= 1, 1-n <= k <= n-1, read by rows.

Table of values

List of values