|
Search: id:A062869
|
|
|
| A062869 |
|
Triangle read by rows: For n >= 1, k >= 0, T(n,k) = 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). |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Number of possible values is 1,2,3,5,7,10,13,17,21,... = A033638. Maximum distance divided by 2 is the same minus one, i.e. 0,1,2,4,6,9,12,16,20,... = A002620.
|
|
EXAMPLE
|
1; 1,1; 1,2,3; 1,3,7,9,4; 1,4,12,24,35,24,20; ...
(4,3,1,2) has distances (3,1,2,2), sum is 8 and there are 4 other permutations of degree 4 with this sum.
|
|
CROSSREFS
|
Cf. A062866, A062867, A062870, A072949.
Sequence in context: A063967 A059397 A071943 this_sequence A102473 A011117 A069269
Adjacent sequences: A062866 A062867 A062868 this_sequence A062870 A062871 A062872
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr), Jun 26 2001
|
|
|
Search completed in 0.002 seconds
|
