A182062 - cp's OEIS frontend

A182062 T(n,k) = C(n+1-k,k)k!(n-k)!, the number of ways for k men and n-k women to form a queue in which no man is next to another man.

n	a(n)
0	1
1	1
2	1
3	2
4	2
5	0
6	6
7	6
8	2
9	0
10	24
11	24
12	12
13	0
14	0
15	120
16	120
17	72
18	12
19	0
20	0
21	720
22	720
23	480
24	144
25	0
26	0
27	0
28	5040
29	5040
30	3600
31	1440
32	144
33	0
34	0
35	0
36	40320
37	40320
38	30240
39	14400
40	2880
41	0
42	0
43	0
44	0
45	362880
46	362880
47	282240
48	151200
49	43200
50	2880
51	0
52	0
53	0
54	0
55	3628800
56	3628800

[1, 1, 1, 2, 2, 0, 6, 6, 2, 0, 24, 24, 12, 0, 0, 120, 120, 72, 12, 0, 0, 720, 720, 480, 144, 0, 0, 0, 5040, 5040, 3600, 1440, 144, 0, 0, 0, 40320, 40320, 30240, 14400, 2880, 0, 0, 0, 0, 362880, 362880, 282240, 151200, 43200, 2880, 0, 0, 0, 0, 3628800, 3628800]

cp's OEIS Frontend

A182062 T(n,k) = C(n+1-k,k)k!(n-k)!, the number of ways for k men and n-k women to form a queue in which no man is next to another man.

Table of values

List of values

cp's OEIS Frontend

A182062 T(n,k) = C(n+1-k,k)*k!*(n-k)!, the number of ways for k men and n-k women to form a queue in which no man is next to another man.

Table of values

List of values

A182062 T(n,k) = C(n+1-k,k)k!(n-k)!, the number of ways for k men and n-k women to form a queue in which no man is next to another man.