A340986 - cp's OEIS frontend

A340986 Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	3
9	0
10	1
11	3
12	10
13	19
14	0
15	1
16	4
17	21
18	92
19	211
20	0
21	1
22	5
23	36
24	255
25	1354
26	3651
27	0
28	1
29	6
30	55
31	544
32	4725
33	29252
34	90921
35	0
36	1
37	7
38	78
39	995
40	12196
41	123903
42	873964
43	3081513
44	0
45	1
46	8
47	105
48	1644
49	26215
50	377904
51	4368729
52	34555880
53	136407699
54	0

[1, 1, 0, 1, 1, 0, 1, 2, 3, 0, 1, 3, 10, 19, 0, 1, 4, 21, 92, 211, 0, 1, 5, 36, 255, 1354, 3651, 0, 1, 6, 55, 544, 4725, 29252, 90921, 0, 1, 7, 78, 995, 12196, 123903, 873964, 3081513, 0, 1, 8, 105, 1644, 26215, 377904, 4368729, 34555880, 136407699, 0]

cp's OEIS Frontend

A340986 Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.

Table of values

List of values