The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324169 Number of labeled graphs covering the vertex set {1,...,n} with no crossing edges. 25
 1, 0, 1, 4, 25, 176, 1353, 11012, 93329, 815104, 7285489, 66324644, 612863337, 5733381616, 54195878137, 516852285668, 4966883732129, 48049936644736, 467566946973537, 4573486005681092, 44942852084894777, 443484037981300144, 4392621673072766505 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Two edges {x,y}, {z,t} are crossing if either x < z < y < t or z < x < t < y. If the vertices are arranged in a circle, this is equivalent to crossing of chords. Covering means there are no isolated vertices. LINKS FORMULA Inverse binomial transform of A054726. MATHEMATICA nn=8; croXQ[stn_]:=MatchQ[stn, {___, {___, x_, ___, y_, ___}, ___, {___, z_, ___, t_, ___}, ___}/; x

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 19 00:35 EST 2020. Contains 332028 sequences. (Running on oeis4.)