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”).

A006430
Number of loopless tree-rooted planar maps with 5 vertices and n faces and no isthmuses.
(Formerly M4036)
2
0, 5, 360, 7350, 73700, 474588, 2292790, 9046807, 30676440, 92393015, 252872984, 639382605, 1512137536, 3377126024, 7176513960, 14599539314, 28575632350, 54036739617, 99069119952, 176618150000, 306965183268, 521265871700, 866527603370, 1412513294049
OFFSET
1,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. R. S. Walsh and A. B. Lehman, Counting rooted maps by genus. III: Nonseparable maps, J. Combinatorial Theory Ser. B 18 (1975), 222-259.
FORMULA
a(n) = n*(n + 2)*(n + 3)*(23*n^10 + 963*n^9 + 17544*n^8 + 147952*n^7 + 481675*n^6 - 1052153*n^5 - 7850914*n^4 - 2900162*n^3 + 60869272*n^2 + 37067400*n - 179920800)/(2*11!) for n > 1.
PROG
(PARI) a(n)={if(n<2, 0, n*(n + 2)*(n + 3)*(23*n^10 + 963*n^9 + 17544*n^8 + 147952*n^7 + 481675*n^6 - 1052153*n^5 - 7850914*n^4 - 2900162*n^3 + 60869272*n^2 + 37067400*n - 179920800)/(2*11!))} \\ Andrew Howroyd, Apr 03 2021
CROSSREFS
Column 5 of A342985.
Sequence in context: A006108 A061456 A218994 * A301613 A180766 A007667
KEYWORD
nonn
EXTENSIONS
Title improved by Sean A. Irvine, Apr 10 2017
Terms a(11) and beyond from Andrew Howroyd, Apr 03 2021
STATUS
approved