OFFSET
4,1
COMMENTS
a(n) is also the sum of the number of spanning forests over all trees with maximum vertex degree 3 with n-3 edges such that there is no vertex of degree 2 in the forest (all vertices in the forest have degree 0, 1, or 3). We can prove that this is correct.
LINKS
M. Brandt and P. A. Helminck, Tropical superelliptic curves, arXiv:1709.05761 [math.AG], 2017. See Table 1 Column 2 p. 14.
EXAMPLE
For n=6, the corresponding tropical curves are given in the top row of figure 6 on page 13 of the Brandt/Helminck reference.
CROSSREFS
KEYWORD
hard,nonn,more
AUTHOR
Madeline Brandt, Sep 21 2017
STATUS
approved