|
Search: id:A134435
|
|
|
| A134435 |
|
Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k odd entries that are followed by a smaller entry (n>=1, k>=0). |
|
+0
6
|
|
| 1, 2, 2, 4, 12, 12, 12, 72, 36, 144, 432, 144, 144, 1728, 2592, 576, 2880, 17280, 17280, 2880, 2880, 57600, 172800, 115200, 14400, 86400, 864000, 1728000, 864000, 86400, 86400, 2592000, 12960000, 17280000, 6480000, 518400
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Row n has ceil(n/2) entries. T(2n,0)=T(2n+1,0)=n!(n+1)!=A010790(n).
|
|
REFERENCES
|
S. Kitaev and J. Remmel, Classifying descents according to parity, Annals of Combinatorics, 11, 2007, 173-193.
|
|
FORMULA
|
T(2n,k)=(n!)^2*binom(n-1,k)binom(n+1,k+1); T(2n+1,k)=n!(n+1)!*binom(n,k)binom(n+1,k)
|
|
EXAMPLE
|
T(3,1)=4 because we have 132, 312, 231, and 321.
Triangle starts:
1;
2;
2,4;
12,12;
12,72,36;
144,432,144;
|
|
MAPLE
|
T:=proc(n, k) if `mod`(n, 2)=0 then binomial((1/2)*n-1, k)*binomial((1/2)*n+1, k+1)*factorial((1/2)*n)^2 elif `mod`(n, 2)=1 then factorial((1/2)*n-1/2)*factorial((1/2)*n+1/2)*binomial((1/2)*n-1/2, k)*binomial((1/2)*n+1/2, k) else 0 end if end proc: for n to 11 do seq(T(n, k), k=0..ceil((1/2)*n)-1) end do; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A010790, A134434.
Sequence in context: A110476 A059343 A112473 this_sequence A136718 A112362 A134720
Adjacent sequences: A134432 A134433 A134434 this_sequence A134436 A134437 A134438
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 22 2007
|
|
|
Search completed in 0.002 seconds
|
