%I A039798
%S A039798 1,1,1,1,3,3,1,6,14,14,1,10,40,84,84,1,15,90,300,594,594,1,21,175,825,
%T A039798 2475,4719,4719,1,28,308,1925,7865,22022,40898,40898,1,36,504,4004,
%U A039798 21021,78078,208208,379236,379236,1,45,780,7644,49686,231868,804440
%N A039798 Triangle read by rows: numbers of Dyck paths.
%D A039798 D. Gouyou-Beauchamps, Chemins sous-diagonaux et tableau de Young, pp. 
               112-125 of "Combinatoire Enumerative (Montreal 1985)", Lect. Notes 
               Math. 1234, 1986.
%H A039798 <a href="Sindx_Y.html#Young">Index entries for sequences related to Young 
               tableaux.</a>
%F A039798 T(n, k)=(n+k)!(n+k+2)!(n-k+3)!/[k!(k+1)!(n-k)!(n+2)!(n+3)! ] for 0<=k<=n. 
               - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004
%e A039798 1; 1,1; 1,3,3; 1,6,14,14; ...
%p A039798 T:=(n,k)->(n+k)!*(n+k+2)!*(n-k+3)!/k!/(k+1)!/(n-k)!/(n+2)!/(n+3)!: seq(seq(T(n,
               k),k=0..n),n=0..10);
%Y A039798 Cf. A039797.
%Y A039798 Reflection of A039797.
%Y A039798 Sequence in context: A110640 A143389 A094040 this_sequence A001498 A138464 
               A117279
%Y A039798 Adjacent sequences: A039795 A039796 A039797 this_sequence A039799 A039800 
               A039801
%K A039798 nonn,tabl,easy,nice
%O A039798 0,5
%A A039798 N. J. A. Sloane (njas(AT)research.att.com).
%E A039798 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004