A263764 - cp's OEIS frontend

A263764 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 one more element moved upwards than downwards.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	1
10	0
11	0
12	0
13	1
14	2
15	0
16	0
17	0
18	1
19	4
20	6
21	0
22	0
23	0
24	1
25	4
26	19
27	14
28	0
29	0
30	0
31	1
32	4
33	31
34	50
35	38
36	0
37	0
38	0
39	1
40	4
41	31
42	106
43	165
44	88
45	0
46	0
47	0
48	1
49	4
50	31
51	146
52	485
53	476
54	217
55	0
56	0
57	0
58	1
59	4
60	31
61	146
62	961
63	1546
64	1543
65	506
66	0
67	0
68	0
69	1
70	4
71	31
72	146
73	1289
74	3662
75	6083
76	4544
77	1209
78	0
79	0
80	0
81	1

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 0, 0, 1, 4, 6, 0, 0, 0, 1, 4, 19, 14, 0, 0, 0, 1, 4, 31, 50, 38, 0, 0, 0, 1, 4, 31, 106, 165, 88, 0, 0, 0, 1, 4, 31, 146, 485, 476, 217, 0, 0, 0, 1, 4, 31, 146, 961, 1546, 1543, 506, 0, 0, 0, 1, 4, 31, 146, 1289, 3662, 6083, 4544, 1209, 0, 0, 0, 1]

cp's OEIS Frontend

A263764 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 one more element moved upwards than downwards.

Table of values

List of values