|
| |
|
|
A091811
|
|
Array read by rows: T(n,k) = binomial(n+k-2,k-1)*binomial(2*n-1,n-k).
|
|
0
| |
|
|
1, 3, 2, 10, 15, 6, 35, 84, 70, 20, 126, 420, 540, 315, 70, 462, 1980, 3465, 3080, 1386, 252, 1716, 9009, 20020, 24024, 16380, 6006, 924, 6435, 40040, 108108, 163800, 150150, 83160, 25740, 3432, 24310, 175032, 556920, 1021020, 1178100, 875160
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Alternating sum of elements of n-th row = 1
If a certain event has a probability p of occurring in any given trial, the probability of its occurring at least n times in 2n-1 trials is sum_{k=1..n} T(n,k)*(-1)^(k-1)*p^(n+k-1). For example, the probability of its occurring at least 4 out of 7 times is 35p^4-84p^5+70p^6-20p^7. - Matthew Vandermast (ghodges14(AT)comcast.net), Jun 05 2004
|
|
|
PROG
| (PARI) T(x, y)=binomial(x+y-2, y-1)*binomial(2*x-1, x-y)
|
|
|
CROSSREFS
| Cf. A001700 (first column), A002740 (second column), A000984 (main diagonal), A033876 (second diagonal).
Sequence in context: A113980 A095675 A006743 * A075856 A025520 A099946
Adjacent sequences: A091808 A091809 A091810 * A091812 A091813 A091814
|
|
|
KEYWORD
| nonn,tabl,nice
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 18 2004
|
| |
|
|
