3542940

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*9^j.at n=25A038263
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*6^j.at n=23A038296
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*10^j.at n=22A038300
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*9^j.at n=26A038311
• Number of forests with two connected components in the complete graph K_{n}.at n=8A083483
• Triangle read by rows: T(n, m) = number of forests with n nodes and m labeled trees. Also number of forests with exactly n - m edges on n labeled nodes.at n=37A105599
• a(n) = 3*a(n-1), with a(1) = 20.at n=11A116530
• Triangle read by rows: T(n, k) is the number of forests on n labeled nodes with k edges. T(n, k) for n >= 1 and 0 <= k <= n-1.at n=43A138464
• a(n) = Sum_{k=0..n} k^3 * 2^(n-k) * binomial(n,k).at n=10A383137