1183644

Appears in sequences

• Triangle of the numbers of different forests of m unrooted trees of smallest order 2, i.e., without isolated vertices, on N labeled nodes.at n=37A105786
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=11A150098
• Triangular array read by row: T(m,n) = number of ways to obtain a single sphere by gluing the (labeled) sides of a (2m+1)-gon and a (2n+1)-gon, m >= n >= 0.at n=20A297897