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 +8*T +6*T^2)*(1-T)^(-7); where T=T(x) is Euler's tree function (see A000169). - Len Smiley, Nov 19 2001
E.g.f.: d^3/dx^3 {x^3/(T(x)^3*(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
a(n) = n*A008788(n). - R. J. Mathar, Oct 31 2015
MAPLE
printlevel := -1; a := [0]; T := x->-LambertW(-x); f := series((T(x)*(1+8*T(x)+6*(T(x))^2)/(1-T(x))^7), x, 24); for m from 1 to 23 do a := [op(a), op(2*m-1, f)*m! ] od; print(a); # Len Smiley, Nov 19 2001
MATHEMATICA
Table[n^(n+3), {n, 0, 20}](* Vladimir Joseph Stephan Orlovsky, Dec 26 2010 *)
PROG
(Magma) [n^(n+3): n in [0..20]]; // Vincenzo Librandi, Jun 11 2013
(PARI) vector(20, n, (n-1)^(n+2)) \\ G. C. Greubel, Sep 11 2019
(Sage) [n^(n+3) for n in (0..20)] # G. C. Greubel, Sep 11 2019
(GAP) List([0..20], n-> n^(n+3)); # G. C. Greubel, Sep 11 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved