cp's OEIS Frontend

A352369 Triangle read by rows. The incomplete Bell transform of the central binomial numbers.

%I A352369 #10 Mar 15 2022 08:17:23
%S A352369 1,0,1,0,2,1,0,6,6,1,0,20,36,12,1,0,70,220,120,20,1,0,252,1380,1140,
%T A352369 300,30,1,0,924,8904,10710,4060,630,42,1,0,3432,59024,101136,52640,
%U A352369 11480,1176,56,1,0,12870,400824,966672,671328,195300,27720,2016,72,1
%N A352369 Triangle read by rows. The incomplete Bell transform of the central binomial numbers.
%F A352369 Given a sequence s let s|n denote the initial segment s(0), s(1), ..., s(n).
%F A352369 (T(s))(n, k) = IncompleteBellPolynomial(n, k, s|n) where s(n) = binomial(2*n, n).
%e A352369 Triangle starts:
%e A352369 [0] 1;
%e A352369 [1] 0,     1;
%e A352369 [2] 0,     2,      1;
%e A352369 [3] 0,     6,      6,      1;
%e A352369 [4] 0,    20,     36,     12,      1;
%e A352369 [5] 0,    70,    220,    120,     20,      1;
%e A352369 [6] 0,   252,   1380,   1140,    300,     30,     1;
%e A352369 [7] 0,   924,   8904,  10710,   4060,    630,    42,    1;
%e A352369 [8] 0,  3432,  59024, 101136,  52640,  11480,  1176,   56,  1;
%e A352369 [9] 0, 12870, 400824, 966672, 671328, 195300, 27720, 2016, 72, 1;
%p A352369 CentralBinomial := n -> binomial(2*n, n):
%p A352369 for n from 0 to 9 do
%p A352369 seq(IncompleteBellB(n, k, seq(CentralBinomial(j), j = 0..n)), k = 0..n) od;
%Y A352369 Cf. A000984, A352370 (row sums), A352371 (alternating row sums).
%Y A352369 Cf. A352363, A352366.
%K A352369 nonn,tabl
%O A352369 0,5
%A A352369 _Peter Luschny_, Mar 15 2022