A228924 - cp's OEIS frontend

A228924 Irregular triangular array read by rows: T(n,k) is the number of derangement permutations of [n] that have exactly k inversions; n>=2, 1<=k<=binomial(n,2) for even n, 1<=k<=binomial(n,2)-1 for odd n.

n	a(n)
2	1
3	0
4	2
5	0
6	1
7	4
8	1
9	2
10	1
11	0
12	0
13	4
14	8
15	4
16	10
17	10
18	6
19	2
20	0
21	0
22	1
23	12
24	18
25	16
26	35
27	44
28	47
29	40
30	25
31	14
32	8
33	4
34	1
35	0
36	0
37	0
38	6
39	32
40	44
41	60
42	118
43	160
44	208
45	244
46	244
47	214
48	174
49	140
50	104
51	64
52	30
53	10
54	2
55	0
56	0
57	0
58	1
59	24
60	83
61	118
62	206
63	388
64	565
65	802
66	1068
67	1308
68	1466
69	1508
70	1479
71	1414
72	1290
73	1076
74	806
75	544
76	333
77	186
78	96
79	46
80	19
81	6
82	1

[1, 0, 2, 0, 1, 4, 1, 2, 1, 0, 0, 4, 8, 4, 10, 10, 6, 2, 0, 0, 1, 12, 18, 16, 35, 44, 47, 40, 25, 14, 8, 4, 1, 0, 0, 0, 6, 32, 44, 60, 118, 160, 208, 244, 244, 214, 174, 140, 104, 64, 30, 10, 2, 0, 0, 0, 1, 24, 83, 118, 206, 388, 565, 802, 1068, 1308, 1466, 1508, 1479, 1414, 1290, 1076, 806, 544, 333, 186, 96, 46, 19, 6, 1]

cp's OEIS Frontend

A228924 Irregular triangular array read by rows: T(n,k) is the number of derangement permutations of [n] that have exactly k inversions; n>=2, 1<=k<=binomial(n,2) for even n, 1<=k<=binomial(n,2)-1 for odd n.

Table of values

List of values