A263787 - cp's OEIS frontend

A263787 T(n,k) = Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and exactly two more elements moved upwards than downwards.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	0
19	1
20	0
21	0
22	0
23	0
24	0
25	1
26	2
27	1
28	0
29	0
30	0
31	0
32	1
33	5
34	10
35	3
36	0
37	0
38	0
39	0
40	1
41	5
42	37
43	31
44	11
45	0
46	0
47	0
48	0
49	1
50	5
51	66
52	116
53	134
54	31
55	0
56	0
57	0
58	0
59	1
60	5
61	66
62	267
63	572
64	439
65	93
66	0
67	0
68	0
69	0
70	1
71	5
72	66
73	392
74	1721
75	2042
76	1604
77	248
78	0
79	0
80	0
81	0
82	1
83	5
84	66
85	392
86	3522

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 1, 5, 10, 3, 0, 0, 0, 0, 1, 5, 37, 31, 11, 0, 0, 0, 0, 1, 5, 66, 116, 134, 31, 0, 0, 0, 0, 1, 5, 66, 267, 572, 439, 93, 0, 0, 0, 0, 1, 5, 66, 392, 1721, 2042, 1604, 248, 0, 0, 0, 0, 1, 5, 66, 392, 3522]

cp's OEIS Frontend

A263787 T(n,k) = Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and exactly two more elements moved upwards than downwards.

Table of values

List of values