|
|
A181528
|
|
Number of connected graphs with n edges embeddable into square lattice.
|
|
2
|
|
|
1, 1, 1, 2, 4, 6, 14, 28, 68, 156, 399, 1012, 2732, 7385, 20665, 58377, 168119, 488771
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
a(n) <= number of connected planar graphs with n edges A046091.
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 3 there are a(3) = 2 graphs: the claw graph, corresponding to a single free polystick, and the 3-path, corresponding to 4 different free polysticks.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
I. E. Kashuba (kashuba(AT)bitp.kiev.ua), Oct 27 2010
|
|
EXTENSIONS
|
Terms a(16)-a(17) from Hehn Table 3.1 and a(0) = 1 added by Andrey Zabolotskiy, Oct 22 2022
|
|
STATUS
|
approved
|
|
|
|