49566

Appears in sequences

• Number of simplicial polyhedra with n vertices; simple planar graphs with n vertices and 3n-6 edges; maximal simple planar graphs with n vertices; planar triangulations with n vertices; triangulations of the sphere with n vertices; 3-connected cubic planar graphs on 2n-4 vertices.at n=10A000109
• Triangle read by rows, based on a simple Fibonacci recursion rule.at n=62A111669
• G.f.: A(x) = exp( Sum_{n>=1} A005261(n)*x^n/n ) where A005261(n) = Sum_{k=0..n} C(n,k)^5.at n=5A218117
• a(n) is the number of maximal simple planar graphs of size n that admit a 2-queue layout.at n=10A298361