%I #41 Aug 20 2018 08:07:14

%S 1,0,1,0,3,1,0,14,10,1,0,84,90,21,1,0,594,825,308,36,1,0,4719,7865,

%T 4004,780,55,1,0,40898,78078,49686,13650,1650,78,1,0,379236,804440,

%U 606424,214200,37400,3094,105,1,0,3711916,8565960,7379904,3162816,724812,88179,5320,136,1

%N Triangle read by rows: the X-transformation of the Catalan triangle A033184.

%H Fangfang Cai, Qing-Hu Hou, Yidong Sun, Arthur L.B. Yang, <a href="https://arxiv.org/abs/1808.05736">Combinatorial identities related to 2×2 submatrices of recursive matrices</a>, arXiv:1808.05736 [math.CO], 2018.

%H Yidong Sun and Fei Ma, <a href="http://arxiv.org/abs/1305.2015">Minors of a Class of Riordan Arrays Related to Weighted Partial Motzkin Paths</a>, arXiv preprint arXiv:1305.2015 [math.CO], 2013.

%H Yidong Sun and Fei Ma, <a href="http://arxiv.org/abs/1305.2017">Four transformations on the Catalan triangle</a>, arXiv preprint arXiv:1305.2017 [math.CO], 2013.

%H Yidong Sun and Fei Ma, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p33">Some new binomial sums related to the Catalan triangle</a>, Electronic Journal of Combinatorics 21(1) (2014), #P1.33

%e Triangle begins:

%e 1;

%e 0, 1;

%e 0, 3, 1;

%e 0, 14, 10, 1;

%e 0, 84, 90, 21, 1;

%e 0, 594, 825, 308, 36, 1;

%e ...

%t nn = 9;

%t c[n_, k_] := Binomial[2n-k, n] (k+1)/(n+1);

%t a[0, 0] = 1;

%t a[n_, k_] := Table[c[n+k+i-1, 2k+j-1], {i, 1, 2}, {j, 1, 2}] // Det;

%t Table[a[n, k], {n, 0, nn}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Aug 12 2018 *)

%o (PARI) C(n, k) = (k<=n)*binomial(2*n-k, n)*(k+1)/(n+1);

%o aX(nn) = {for (n = 0, nn, for (k = 0, n, print1(matdet(matrix(2, 2, i, j, C(n+k+i-1, 2*k+j-1))), ", ");); print(););} \\ _Michel Marcus_, Feb 13 2014

%Y Cf. A033184, A179898, A228335, A228336, A228337.

%K nonn,tabl

%O 0,5

%A _N. J. A. Sloane_, Aug 26 2013

%E More terms from _Michel Marcus_, Feb 13 2014

%E A-number for Catalan triangle changed by _Michel Marcus_, Feb 13 2014