OFFSET
1,2
COMMENTS
Note that Sum_{g>=0} D(n,g) gives A057005 which is the number of dessins d'enfants with n edges (as one would hope).
We get a new genus every two edges.
n=7 is the first time we have more dessins of genus 1 than genus 0.
LINKS
Paawan Jethva, Exploring the Euler Characteristics of Dessins d’Enfants, 2023, page 15.
A. Mednykh and R. Nedela, Recent progress in enumeration of hypermaps, J. Math. Sci., New York 226, No. 5, 635-654 (2017) and Zap. Nauchn. Semin. POMI 446, 139-164 (2016), tables 2-8 and theorems 8-12. Theorem 12 has typos; the corrected formula can be inferred from Karabáš's tables.
EXAMPLE
Triangle D(n,g) begins:
n\g 0 1 2 3 4 ...
1 1
2 3
3 6 1
4 20 6
5 60 33 4
6 291 285 48
7 1310 2115 708 30
8 6975 16533 9807 1155
9 37746 126501 119436 29910 900
...
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Paawan Jethva, Jun 22 2025
EXTENSIONS
Rows 10-11 from Andrei Zabolotskii, Jun 28 2025
STATUS
approved
