270270

Appears in sequences

• Exponential generating function: (1+3*x)/(1-2*x)^(7/2).at n=5A000457
• Tenth column of quintinomial coefficients.at n=10A000575
• Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=39A001497
• Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=41A001498
• Triangle T(n,k) of associated Stirling numbers of second kind, n >= 2, 1 <= k <= floor(n/2).at n=41A008299
• Form array in which n-th row is obtained by expanding (1 + x + x^2)^n and taking the 4th column from the center.at n=10A014533
• Triangle of numbers arising from analysis of Levine's sequence A011784.at n=43A014621
• Triangular table of 2^n *(n+k)! / ((n-k)! * k! * 4^k).at n=34A043302
• Bessel polynomial {y_n}'''(0).at n=11A065949
• Denominator of Borwein integral of order 2n+1, as defined by Weisstein.at n=6A068215
• Triangle formed from coefficients of the polynomials p(1)=x, p(n+1) = (n + x*(n+1))*p(n) + x*x*(d/dx)p(n).at n=26A075856
• a(n) = (n-p_1)(n-p_2)...(n-p_k) where p_k is the k-th prime and is also the largest prime < n.at n=15A080497
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. Let A(n,k) be the triangle in A097474. Then T(n,k) is defined by the orthogonality relations Sum_{j=i..r} T(r,j)*A(j,i)*2^-floor((j+3)/2) = 0 if i != r, = (2r+1)!/(r!*2^r) if i = r.at n=35A097749
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. Let A(n,k) be the triangle in A097474. Then T(n,k) is defined by the orthogonality relations Sum_{j=i..r} T(r,j)*A(j,i)*2^-floor((j+3)/2) = 0 if i != r, = (2r+1)!/(r!*2^r) if i = r.at n=26A097749
• a(n) = (2*n)!/(n!*2^(n-1)).at n=7A097801
• Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).at n=54A100861
• Triangle read by rows: T(n,k) is the sum of the weights of all vertices labeled k at depth n in the Catalan tree (1 <= k <= n+1, n >= 0).at n=29A102625
• Triangle read by rows giving coefficients of Bessel polynomial p_n(x).at n=50A104548
• a(n) = binomial(2*n,n) * Fibonacci(n).at n=8A119692
• Triangle read by rows: see A128196 for definition.at n=29A126063