69275

Appears in sequences

• Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to -1,0,1, with n nodes that have no label greater than k.at n=34A101486
• 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), (1, 1, 0), (1, 1, 1)}.at n=8A150955
• Number of Dyck paths of semilength n avoiding the pattern U^4 D^4 U D.at n=33A225691