|
Search: id:A152878
|
|
|
| A152878 |
|
Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} with maximal number of initial entries of the same parity equal to k (1<=k<=ceil(n/2)). |
|
+0
1
|
|
| 1, 2, 4, 2, 16, 8, 72, 36, 12, 432, 216, 72, 2880, 1440, 576, 144, 23040, 11520, 4608, 1152, 201600, 100800, 43200, 14400, 2880, 2016000, 1008000, 432000, 144000, 28800, 21772800, 10886400, 4838400, 1814400, 518400, 86400, 261273600
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sum of entries in row n is n! =A000142(n).
Row n contains ceil(n/2) entries.
|
|
FORMULA
|
a(2n,k)=2nk!(2n-k-1)!binom(n,k);
a(2n+1,k)=n!(n+1)!*binom(2n-k+1,n).
|
|
EXAMPLE
|
T(4,2)=8 because we have 1324, 1342, 3124, 3142, 2413, 2431, 4213 and 4231.
T(5,3)=12 because the first 3 entries form a permutation of (1,3,5) (6 choices) and the last 2 entries form a permutation of {2,4} (2 choices).
Triangle starts:
1;
2;
4,2;
16,8;
72,36,12;
432,216,72;
|
|
MAPLE
|
ae := proc (n, k) options operator, arrow: 2*n*factorial(k)*factorial(2*n-k-1)*binomial(n, k) end proc: ao := proc (n, k) options operator, arrow: factorial(n)*factorial(n+1)*binomial(2*n-k+1, n) end proc: a := proc (n, k) if `mod`(n, 2) = 0 and k <= (1/2)*n then ae((1/2)*n, k) elif `mod`(n, 2) = 1 and k <= ceil((1/2)*n) then ao((1/2)*n-1/2, k) else 0 end if end proc: for n to 12 do seq(a(n, k), k = 1 .. ceil((1/2)*n)) end do; # yields sequence in triangular form
|
|
CROSSREFS
|
A000142
Sequence in context: A152877 A071353 A134763 this_sequence A100944 A059890 A006496
Adjacent sequences: A152875 A152876 A152877 this_sequence A152879 A152880 A152881
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 26 2008
|
|
|
Search completed in 0.002 seconds
|
