62370

Appears in sequences

• Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=30A001497
• Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=33A001498
• a(n) = (2n+2)!/(n!*2^(n+1)).at n=5A001879
• Triangle read by rows: number of P-graphs by number of edges and number of non-root nodes.at n=42A011268
• a(n) = 35*(n+1)*binomial(n+4, 7)/4.at n=5A027803
• a(n) = 14*(n+1)*binomial(n+4,8).at n=4A027804
• A triangle of numbers related to triangle A030528; array a(n,m), read by rows (1 <= m <= n).at n=72A049403
• Triangle read by rows: T(n, k) = [z^k] P(n, z) where P(n, z) = Sum_{k=0..n} binomial(n, k) * Pochhammer(n - k + c, k) * z^k / k! and c = 4.at n=49A062145
• Triangle of coefficients of Bessel polynomials {y_n(x)}'.at n=20A065931
• Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=31A074053
• a(n) = (n-c_1)(n-c_2)...(n-c_k) where c_k is the k-th composite number and is also the largest composite number < n.at n=14A080498
• a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).at n=23A082637
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).at n=26A085881
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).at n=22A085881
• Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).at n=47A100861
• Triangle read by rows giving coefficients of Bessel polynomial p_n(x).at n=41A104548
• Number of topologically distinct trees with n vertices, including Steiner trees.at n=6A104653
• a(n) = binomial(n+5,5)*binomial(n+8,8).at n=4A107420
• Triangle of Bessel numbers read by rows. Row n gives T(n,n), T(n,n-1), T(n,n-2), ..., T(n,1) for n >= 1.at n=71A111924
• 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=25A119743