A380364 Number of rooted combinatorial maps with n edges and without faces of degree 1.
1, 1, 4, 30, 284, 3240, 43282, 662760, 11446844, 220193310, 4669558564, 108251161920, 2723857695362, 73941952968000, 2154117314613604, 67038931862069790, 2219781607638887804, 77922680046440538600, 2890682855602209593362, 112998995448368143038120, 4642614436461699746566364
Offset: 0
Keywords
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..200
Programs
-
PARI
seq(n)={my(A=O(x^(2*n+1)), g=serconvol(exp(x^2/2 + A),exp(-x + A)/(1-x))); Vec(substpol(1 + x*deriv(log(serlaplace(g))), x^2, x))}