id:A062869 - OEIS Search Results

Search: id:A062869

Displaying 1-1 of 1 results found.

page 1

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)

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research