OFFSET
1,1
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1000
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.
Index entries for linear recurrences with constant coefficients, signature (10,-45,120,-210,252,-210,120,-45,10,-1).
FORMULA
a(n) = 4 * binomial(n + 4, 5) + 51 * binomial(n + 4, 6) + 163 * binomial(n + 4, 7) + 194 * binomial(n + 4, 8) + 78 * binomial(n + 4, 9). - Sean A. Irvine, Apr 03 2017
a(n) = binomial(n+5,6)*(n + 3)*(13*n^2 + 57*n + 14)/84. - Andrew Howroyd, Apr 05 2021
G.f.: x*(4 + 35*x + 34*x^2 + 5*x^3)/(1 - x)^10. - Stefano Spezia, Aug 19 2025
MATHEMATICA
A006412[n_] := Binomial[n + 5, 6]*(n + 3)*(n*(13*n + 57) + 14)/84;
Array[A006412, 30] (* Paolo Xausa, Aug 20 2025 *)
PROG
(PARI) a(n) = {binomial(n+5, 6)*(n + 3)*(13*n^2 + 57*n + 14)/84} \\ Andrew Howroyd, Apr 05 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Terms a(11) and beyond from Andrew Howroyd, Apr 05 2021
STATUS
approved
