login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A347951
a(n) = number of maximal chord diagrams by genus d^(||)_2n.
0
1, 5, 41, 509, 8229, 166377, 4016613, 113044185, 3630535785, 131095612845, 5256401729985, 231748716159765, 11142710564597325, 580259659715478225, 32535080119520689725
OFFSET
1,2
COMMENTS
Also, number of rooted maps with one face, one vertex and n edges on both orientable and non-orientable surfaces.
LINKS
Evgeniy Krasko, Counting Unlabelled Chord Diagrams of Maximal Genus, arXiv:1709.00796 [math.CO], 2017. See Appendix Table 1.
M. Ledoux, A recursion formula for the moments of the Gaussian orthogonal ensemble, Annales de l’Institut Henri Poincaré - Probabilités et Statistiques, 2009, Vol. 45, No. 3, 754-769.
FORMULA
Ledoux's article gives a five-term recurrence for related polynomials.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Michael De Vlieger, Nov 02 2021
STATUS
approved