OFFSET
1,2
COMMENTS
The terms up to a(21) were computed by Michael Borinsky and Jos Vermaseren using a program written in FORM. The graphs enumerated by a(n) are called admissible (Borinsky and Vogtmann, 2023).
LINKS
Michael Borinsky and Karen Vogtmann, The Euler characteristic of the moduli space of graphs, arXiv:2301.01121 [math.AT], 2023.
Tony Guttmann, Asymptotics for A360864
Leila Sloman, Quantum Field Theory Pries Open Mathematical Puzzle, Quanta Magazine, Feb 2023.
FORMULA
a(n) = Sum_{k>=1} A360862(n + k - 1, k).
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Howroyd and William P. Orrick, Feb 24 2023
STATUS
approved