OFFSET
0,4
COMMENTS
a(n) <= number of connected planar graphs with n edges A046091.
LINKS
Andreas R. Hehn, Series Expansion Methods for Quantum Lattice Models, Doctoral Thesis, ETH Zürich, 2016.
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