OFFSET
1,4
COMMENTS
Exponential Riordan array (1,x/cos(x)). The column of index 0 contains a 1 followed by zeros and is not reproduced in this triangle.
FORMULA
T(n,k)=binomial(n,k)*(1+(-1)^(n-k))*sum(m=1..n-k , (-1)^m*binomial(m+k-1,k-1)*sum(j=1..m, 2^(-j)*(sum(i=0..floor((j-1)/2)) , (j-2*i)^(n-k)*binomial(j,i))*binomial(m,j)*(-1)^((n-k)/2-m+j))), n>k, T(n,n)=1.
MAPLE
# The function BellMatrix is defined in A264428.
# Adds (1, 0, 0, 0, ..) as column 0.
BellMatrix(n -> `if`(n::even, (-1)^(n/2)*(n+1)*euler(n), 0), 10); # Peter Luschny, Jan 29 2016
MATHEMATICA
BellMatrix[f_, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
B = BellMatrix[Function[n, If[EvenQ[n], (-1)^(n/2)*(n + 1)*EulerE[n], 0]], rows = 12];
Table[B[[n, k]], {n, 2, rows}, {k, 2, n}] // Flatten (* Jean-François Alcover, Jun 28 2018, after Peter Luschny *)
PROG
(Maxima)
T(n, k):=if n=k then 1 else binomial(n, k)*(1+(-1)^(n-k))*sum((-1)^m*binomial(m+k-1, k-1)*sum(2^(-j)*(sum((j-2*i)^(n-k)*binomial(j, i), i, 0, floor((j-1)/2)))*binomial(m, j)*(-1)^((n-k)/2-m+j), j, 1, m), m, 1, n-k);
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Vladimir Kruchinin, Apr 11 2011
STATUS
approved