118668

Appears in sequences

• Number of rooted simplicial 3-polytopes with n+3 nodes; or rooted 3-connected triangulations with 2n+2 faces; or rooted 3-connected trivalent maps with 2n+2 vertices.at n=8A000260
• a(n) is the number of binary strings of length n such that there exists a subsequence of length 4 containing 3 or more ones.at n=16A118646
• Array T(n,m) = 2*(2m+3)!*(4n+2m+1)!/(m!*(m+2)!*n!*(3n+2m+3)!) read by antidiagonals.at n=36A146305
• Smallest possible largest number of a 4 by n average array where repetitions are not allowed without diagonals.at n=5A195754
• Smallest possible largest number in a 7 by n average array where repetitions are not allowed without diagonals.at n=2A195757
• Array a(n,m) read by descending antidiagonals giving the number of intervals in a generalized Tamari lattice of m-ballot paths of size n.at n=43A255918
• Triangle read by rows: T(n,k) is the number of c-nets with n+1 faces and k+1 vertices.at n=82A290326
• Array read by antidiagonals: T(n,k) is the number of rooted strong triangulations of a disk with n interior nodes and 3+k nodes on the boundary.at n=44A341856
• Erroneous version of A000260.at n=7A362102