30880

Appears in sequences

• Number of simple triangulations of the plane with n nodes.at n=10A000256
• Expansion of Product_{m>=1} (1 - m*q^m)^8.at n=13A022668
• Number of 6-ary rooted trees with n nodes and height at most 9.at n=14A036626
• Number of permutations of the numbers 1 through 2n satisfying the "Alex Fink" condition: there is one and only one partial sum in each interval (k(n+1),(k+1)(n+1)] for 0<=k<2n-1.at n=4A126429
• Square array read by upwards antidiagonals: T(m,n) is the number of simple 3-connected triangulations of a closed region in the plane with m+3 given external edges and 3n+m internal edges, m>=0, n>=1.at n=54A210664
• Number of compositions of n into distinct parts with exactly nine descents.at n=18A241728
• Partial sums of A294629.at n=31A294630