OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
FORMULA
E.g.f.(x): T*(1 + 2*T)*(1-T)^(-5); where T=T(x) is Euler's tree function (see A000169). - Len Smiley, Nov 17 2001
E.g.f.: d^2/dx^2 {x^2/(T(x)^2*(1-T(x))}, where T(x) = sum {n >= 1} n^(n-1)*x^n/n! is the tree function of A000169. - Peter Bala, Aug 05 2012
EXAMPLE
G.f. = x + 16*x^2 + 243*x^3 + 4096*x^4 + 78125*x^5 + 1679616*x^6 + ...
MATHEMATICA
Table[n^(n+2), {n, 0, 20}] (* Vladimir Joseph Stephan Orlovsky, Dec 26 2010 *)
CoefficientList[Series[LambertW[-x] * (2*LambertW[-x]-1) / (1 + LambertW[-x])^5, {x, 0, 20}], x] * Range[0, 20]! (* Vaclav Kotesovec, Dec 20 2014 *)
PROG
(Magma) [n^(n+2): n in [0..20]]; // Vincenzo Librandi, Jun 11 2013
(PARI) vector(20, n, (n-1)^(n+1)) \\ G. C. Greubel, Nov 14 2017
(Sage) [n^(n+2) for n in (0..20)] # G. C. Greubel, Sep 11 2019
(GAP) List([0..20], n-> n^(n+2)); # G. C. Greubel, Sep 11 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved