370098

Appears in sequences

• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 2, 1, 1.at n=17A025243
• Triangle read by rows: number of 0-1-2 trees (i.e., ordered trees with vertices of outdegrees 0, 1, or 2) with n edges and exactly k vertices that have 2 children, both being leaves (n >= 0, 0 <= k <= floor((n+2)/4)).at n=48A126191