339456

Appears in sequences

• Number of rooted bicubic maps: a(n) = (8*n-4)*a(n-1)/(n+2) for n >= 2, a(0) = a(1) = 1.at n=9A000257
• Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to +-1, with n nodes that have no label greater than k.at n=54A101477
• Triangle read by rows: T(n,k) is the number of rooted hypermaps of genus k with n darts.at n=20A321710