106416

Appears in sequences

• Number of rooted labeled trees of height 2 such that every leaf is at a distance 2 from the root.at n=9A220232
• Triangular array read by rows. T(n,k) is the number of labeled rooted trees of height at most 2 with exactly k leaves at a distance 1 from the root, n>=1, 0<=k<=n-1.at n=36A220233
• Irregular triangular array T; row n shows the coefficients of the (n-1)-st polynomial in the obverse convolution s(x)**t(x), where s(x) = x+1 and t(x) = F(n) = n-th Fibonacci number. See Comments.at n=36A375047