A062869 - cp's OEIS frontend

A062869 Triangle read by rows: For n >= 0, k >= 0, T(n,k) is the number of permutations pi of n such that the total distance Sum_i abs(i-pi(i)) = 2k. Equivalently, k = Sum_i max(i-pi(i),0).

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	3
7	1
8	3
9	7
10	9
11	4
12	1
13	4
14	12
15	24
16	35
17	24
18	20
19	1
20	5
21	18
22	46
23	93
24	137
25	148
26	136
27	100
28	36
29	1
30	6
31	25
32	76
33	187
34	366
35	591
36	744
37	884
38	832
39	716
40	360
41	252
42	1
43	7
44	33
45	115
46	327
47	765
48	1523
49	2553
50	3696
51	4852
52	5708
53	5892
54	5452
55	4212
56	2844
57	1764
58	576
59	1
60	8
61	42
62	164
63	524

[1, 1, 1, 1, 1, 2, 3, 1, 3, 7, 9, 4, 1, 4, 12, 24, 35, 24, 20, 1, 5, 18, 46, 93, 137, 148, 136, 100, 36, 1, 6, 25, 76, 187, 366, 591, 744, 884, 832, 716, 360, 252, 1, 7, 33, 115, 327, 765, 1523, 2553, 3696, 4852, 5708, 5892, 5452, 4212, 2844, 1764, 576, 1, 8, 42, 164, 524]

cp's OEIS Frontend

A062869 Triangle read by rows: For n >= 0, k >= 0, T(n,k) is the number of permutations pi of n such that the total distance Sum_i abs(i-pi(i)) = 2k. Equivalently, k = Sum_i max(i-pi(i),0).

Table of values

List of values