|
Search: id:A111910
|
|
|
| A111910 |
|
Square array read by antidiagonals: T(p,q)=(p+q+1)!(2p+2q+1)!/[(p+1)!(2p+1)!(q+1)!(2q+1)! ] (p,q>=0). |
|
+0
3
|
|
| 1, 1, 1, 1, 5, 1, 1, 14, 14, 1, 1, 30, 84, 30, 1, 1, 55, 330, 330, 55, 1, 1, 91, 1001, 2145, 1001, 91, 1, 1, 140, 2548, 10010, 10010, 2548, 140, 1, 1, 204, 5712, 37128, 68068, 37128, 5712, 204, 1, 1, 285, 11628, 116280, 352716, 352716, 116280, 11628, 285, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
T(n,n)=A111911(n)
|
|
REFERENCES
|
G. Kreweras and H. Niederhausen, Solution of an enumerative problem connected with lattice paths, European J. Combin., 2 (1981), 55-60.
|
|
MAPLE
|
a:=(p, q)->(p+q+1)!*(2*p+2*q+1)!/(p+1)!/(2*p+1)!/(q+1)!/(2*q+1)!: for n from 0 to 10 do seq(a(j, n-j), j=0..n) od; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A111911.
Sequence in context: A152654 A157177 A119725 this_sequence A144438 A157207 A008957
Adjacent sequences: A111907 A111908 A111909 this_sequence A111911 A111912 A111913
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 19 2005
|
|
|
Search completed in 0.002 seconds
|
