A321352 - cp's OEIS frontend

A321352 Triangle T(n,k) giving the number of permutations pi of {1,2,...,n} such that for all i, pi(i) is not in {i, i+1, ..., i+k-1} (mod n), with 0 <= k <= n - 1.

n	a(n)
1	1
2	2
3	1
4	6
5	2
6	1
7	24
8	9
9	2
10	1
11	120
12	44
13	13
14	2
15	1
16	720
17	265
18	80
19	20
20	2
21	1
22	5040
23	1854
24	579
25	144
26	31
27	2
28	1
29	40320
30	14833
31	4738
32	1265
33	264
34	49
35	2
36	1
37	362880
38	133496
39	43387
40	12072
41	2783
42	484
43	78
44	2
45	1
46	3628800
47	1334961
48	439792
49	126565
50	30818
51	6208
52	888
53	125
54	2
55	1

[1, 2, 1, 6, 2, 1, 24, 9, 2, 1, 120, 44, 13, 2, 1, 720, 265, 80, 20, 2, 1, 5040, 1854, 579, 144, 31, 2, 1, 40320, 14833, 4738, 1265, 264, 49, 2, 1, 362880, 133496, 43387, 12072, 2783, 484, 78, 2, 1, 3628800, 1334961, 439792, 126565, 30818, 6208, 888, 125, 2, 1]

cp's OEIS Frontend

A321352 Triangle T(n,k) giving the number of permutations pi of {1,2,...,n} such that for all i, pi(i) is not in {i, i+1, ..., i+k-1} (mod n), with 0 <= k <= n - 1.

Table of values

List of values