The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A326340 Number of maximal simple graphs with vertices {1..n} and no crossing or nesting edges. 6
 1, 1, 1, 1, 4, 9, 19, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Two edges {a,b}, {c,d} are crossing if a < c < b < d or c < a < d < b, and nesting if a < c < d < b or c < a < b < d. LINKS Table of n, a(n) for n=0..7. Gus Wiseman, The a(6) = 19 maximal non-crossing non-nesting graphs. MATHEMATICA fasmax[y_]:=Complement[y, Union@@(Most[Subsets[#]]&/@y)]; Table[Length[fasmax[Select[Subsets[Subsets[Range[n], {2}]], !MatchQ[#, {___, {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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 20 21:52 EST 2024. Contains 370219 sequences. (Running on oeis4.)