945945

Appears in sequences

• Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=38A001497
• Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=49A001497
• Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=42A001498
• Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=50A001498
• a(n) = (2n+2)!/(n!*2^(n+1)).at n=6A001879
• Coefficients of Bessel polynomials y_n (x).at n=5A001880
• Triangle of D-analogs of Stirling numbers of first kind.at n=36A039762
• Triangle of D-analogs of Stirling numbers of first kind, rows reversed.at n=44A039763
• Triangle of coefficients of Bessel polynomials {y_n(x)}'.at n=27A065931
• Triangle of coefficients of a companion polynomial to the Gandhi polynomial.at n=26A083061
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).at n=29A085881
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).at n=34A085881
• Another version of triangular array in A083061: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 3, 6, 10, 15, 21, 28, ...] DELTA [1, 2, 3, 4, 5, 6, 7, 8, ...] where DELTA is the operator defined in A084938.at n=34A094665
• Coefficients of polynomial in x multiplying sinh(x) in the modified spherical Bessel function of the first kind i_n(x).at n=38A094674
• Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).at n=61A100861
• Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).at n=62A100861
• Reduced denominators of x^(2n) in the series expansion of erf(x)^2 Pi/4 about 0.at n=7A103980
• Triangle read by rows giving coefficients of Bessel polynomial p_n(x).at n=51A104548
• Triangle read by rows: row n gives number of matchings of size 0<=k<=n (edges) in the complete graph on 2*n >= 2 vertices.at n=32A119743
• Triangle read by rows: row n gives number of matchings of size 0<=k<=n (edges) in the complete graph on 2*n >= 2 vertices.at n=33A119743