A306191 - cp's OEIS frontend

A306191 T(n,k) is a triangular array read by rows. Let S_n act on the set of size two subsets of {1,2,...,n}. T(n,k) is the number of permutations in S_n that fix exactly k size two subsets, n >= 1, 0 <= k <= binomial(n,2).

n	a(n)
1	1
2	0
3	2
4	2
5	3
6	0
7	1
8	14
9	0
10	9
11	0
12	0
13	0
14	1
15	54
16	40
17	15
18	0
19	10
20	0
21	0
22	0
23	0
24	0
25	1
26	304
27	300
28	0
29	100
30	0
31	0
32	0
33	15
34	0
35	0
36	0
37	0
38	0
39	0
40	0
41	1
42	2260
43	1638
44	630
45	315
46	0
47	105
48	70
49	0
50	0
51	0
52	0
53	21
54	0
55	0
56	0
57	0
58	0
59	0
60	0
61	0
62	0
63	1
64	18108
65	12992
66	5460
67	1344
68	1645
69	0
70	420
71	0
72	210
73	0
74	112
75	0
76	0
77	0
78	0
79	0
80	28
81	0
82	0
83	0
84	0
85	0
86	0
87	0
88	0
89	0
90	0
91	0
92	1

[1, 0, 2, 2, 3, 0, 1, 14, 0, 9, 0, 0, 0, 1, 54, 40, 15, 0, 10, 0, 0, 0, 0, 0, 1, 304, 300, 0, 100, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 1, 2260, 1638, 630, 315, 0, 105, 70, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 18108, 12992, 5460, 1344, 1645, 0, 420, 0, 210, 0, 112, 0, 0, 0, 0, 0, 28, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A306191 T(n,k) is a triangular array read by rows. Let S_n act on the set of size two subsets of {1,2,...,n}. T(n,k) is the number of permutations in S_n that fix exactly k size two subsets, n >= 1, 0 <= k <= binomial(n,2).

Table of values

List of values