1057221
domain: N
Appears in sequences
- Central factorial numbers: 1st subdiagonal of A008956.at n=4A001824
- Triangle of central factorial numbers |4^k t(2n+1,2n+1-2k)| read by rows (n>=0, k=0..n).at n=19A008956
- Triangle T(n,k) defined by the generating function cosh(sqrt(y)*arcsin(x)) + sqrt(y)*sinh(sqrt(y)*arcsin(x)) - 1 = Sum_{n>=1} Sum_{k=1..n} T(n,k)*y^k *x^n/n!.at n=31A091885
- Triangle T(n,k) defined by the generating function: exp(y*arcsin(x))-1 = Sum_{n>=1} (Sum_{k=1..n} T(n,k)*y^k)*x^n/n!.at n=57A121408
- Table of the number of (n,k)-Riordan complexes, read by rows.at n=16A160563
- Triangle read by rows: coefficients in expansion of Q(n) = (x-n^2)*(x-(n-2)^2)*(x-(n-4)^2)*...*(x-(1 or 2)^2), highest powers first.at n=33A182971
- Square array T(n,k), n>=0, k>=0, read by antidiagonals: T(n,k) = ((2n-1)!!)^k * Sum_{i=1..n} 1/(2*i-1)^k.at n=33A291656
- Exponential Riordan array (1, arcsin(x)).at n=69A385343