3689697

Appears in sequences

• Number of noncrossing connected graphs on n nodes on a circle having no four-sided faces.at n=8A045744
• Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.at n=20A094046