|
| |
|
|
A059103
|
|
Number of connected graphs on n points realizable in the plane with straight edges all of identical length; lines are permitted to cross.
|
|
0
| | |
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| This counting problem is related to the well known problem to find the "chromatic number of the plane"
|
|
|
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
| Sequence in context: A067021 A098716 A082938 * A112836 A105905 A075738
Adjacent sequences: A059100 A059101 A059102 * A059104 A059105 A059106
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| David Newman (DavidSNewman@gmail.com), Feb 13 2001
|
| |
|
|
