|
Search: id:A065602
|
|
|
| A065602 |
|
Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k. |
|
+0
2
|
|
| 1, 1, 1, 3, 2, 1, 8, 6, 3, 1, 24, 18, 10, 4, 1, 75, 57, 33, 15, 5, 1, 243, 186, 111, 54, 21, 6, 1, 808, 622, 379, 193, 82, 28, 7, 1, 2742, 2120, 1312, 690, 311, 118, 36, 8, 1, 9458, 7338, 4596, 2476, 1164, 474, 163, 45, 9, 1, 33062, 25724, 16266, 8928, 4332, 1856, 692, 218
(list; table; graph; listen)
|
|
|
OFFSET
|
2,4
|
|
|
COMMENT
|
A Riordan triangle.
Subtriangle of triangle in A167772. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 14 2009]
|
|
REFERENCES
|
E. Deutsch and L. Shapiro, A survey of the Fine numbers, Discrete Math., 241 (2001), 241-265.
|
|
FORMULA
|
T(n, k)= sum((k-1+2j)*binomial(2n-k-1-2j, n-1)/(2n-k-1-2j), j=0..floor((n-k)/2)). G.f.=t^2*z^2*C/[(1-z^2*C^2)(1-tzC)], where C=(1-sqrt(1-4z))/(2z) is the Catalan function. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 23 2004
|
|
EXAMPLE
|
Example: T(3,2)=1 reflecting the unique Dyck path (UUDUDD) of length 6, with no hills and height of first peak equal to 2.
1; 1,1; 3,2,1; 8,6,3,1; ...
|
|
MAPLE
|
a := proc(n, k) if n=0 and k=0 then 1 elif k<2 or k>n then 0 else sum((k-1+2*j)*binomial(2*n-k-1-2*j, n-1)/(2*n-k-1-2*j), j=0..floor((n-k)/2)) fi end: seq(seq(a(n, k), k=2..n), n=1..14);
|
|
CROSSREFS
|
Row sums give A000957 (the Fine sequence). First column is A000958.
Sequence in context: A158474 A090452 A110439 this_sequence A016648 A104552 A101413
Adjacent sequences: A065599 A065600 A065601 this_sequence A065603 A065604 A065605
|
|
KEYWORD
|
nonn,tabl,easy,nice,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 02 2001
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 23 2004
|
|
|
Search completed in 0.002 seconds
|
