This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059103 Number of simple, connected, unit-distance graphs on n points realizable in the plane with straight edges all of the same length; lines are permitted to cross. 2
 1, 1, 2, 5, 13, 51, 222 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS This counting problem is related to finding the chromatic number of the plane, X(R^2). a(7) >= 213. - Eric W. Weisstein, Apr 30 2018 LINKS Matthew McAndrews, Simple Connected Units Distance Graphs Through 6 Vertices Hans Parshall, Coordinates for unit distance graphs of order 7 Hans Parshall, Unit distance graphs of order 7 Eric Weisstein's World of Mathematics, Connected Graph Eric Weisstein's World of Mathematics, Unit-Distance Graph EXAMPLE a(4)=5 because the complete graph on 4 points cannot be realized in the plane with all edges of equal length. All the other connected graphs with 4 points can be realized. CROSSREFS Cf. A303792 (number of connected matchstick graphs). Sequence in context: A098716 A082938 A303792 * A260709 A112836 A105905 Adjacent sequences:  A059100 A059101 A059102 * A059104 A059105 A059106 KEYWORD hard,more,nonn AUTHOR David S. Newman, Feb 13 2001 EXTENSIONS a(6) has been updated to reflect the fact that it has recently been proved to be 51 rather than 50. - Matthew McAndrews, Feb 21 2016 a(7) from Hans Parshall, May 03 2018 STATUS approved

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

Last modified August 21 13:31 EDT 2018. Contains 313954 sequences. (Running on oeis4.)