|
%I #21 Feb 23 2024 08:34:24
%S 1,1,0,1,3,0,1,6,15,0,1,9,39,91,0,1,12,72,272,612,0,1,15,114,570,1995,
%T 4389,0,1,18,165,1012,4554,15180,32890,0,1,21,225,1625,8775,36855,
%U 118755,254475,0,1,24,294,2436,15225,75516,302064,949344,2017356,0
%N Triangle read by rows. T(n,k) = Sum_{j=0..k} binomial(k-j+2, 2)*T(n-1, j), for n>=0, 0<=k<=n, with T(0,0)=1 and T(n,n)=0 for n>0.
%H Paolo Xausa, <a href="/A339350/b339350.txt">Table of n, a(n) for n = 0..11475</a> (rows 0..150 of the triangle, flattened).
%H Francesca Aicardi, <a href="https://arxiv.org/abs/2011.14628">Catalan triangle and tied arc diagrams</a>, arXiv:2011.14628 [math.CO], 2020.
%H Francesca Aicardi, <a href="https://arxiv.org/abs/2310.07317">Fuss-Catalan Triangles</a>, arXiv:2310.07317 [math.CO], 2023.
%e Triangle begins:
%e 1;
%e 1, 0;
%e 1, 3, 0;
%e 1, 6, 15, 0;
%e 1, 9, 39, 91, 0;
%e 1, 12, 72, 272, 612, 0;
%e ...
%t A339350[n_, k_] := A339350[n, k] = Which[k == 0, 1, n == k, 0, True, Sum[Binomial[k-j+2, 2]*A339350[n-1, j], {j, 0, k}]];
%t Table[A339350[n, k], {n, 0, 10}, {k, 0, n}] (* _Paolo Xausa_, Feb 23 2024 *)
%o (PARI) T(n,k) = if ((n==0) && (k==0), 1, if (n<=k, 0, sum(j=0, k, binomial(k-j+2, 2)*T(n-1, j))));
%Y Cf. subdiagonals: A006632, A006633, A006634, A006635.
%Y Cf. A002293 (row sums).
%K nonn,tabl
%O 0,5
%A _Michel Marcus_, Dec 01 2020
|
