login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097174 Total number of red nodes among tricolored labeled trees on n nodes. 9
1, 0, 6, 12, 320, 2190, 51492, 685496, 17286768, 348213690, 9956411300, 266065478052, 8737396913544, 287741445880070, 10816320294520860, 420123621828718320, 17913098835916877792, 798053882730994171890, 38192029991097097185108, 1914946396460982552420380 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
S. Coulomb and M. Bauer, On vertex covers, matchings and random trees, arXiv:math/0407456 [math.CO], 2004.
FORMULA
E.g.f.: A(x) = -T(-T(x)), with T(x) = Sum_{k>=1} A000169(k)/k!*x^k.
a(n) = -n^(n-1) * Sum_{j=1..n} (-j/n)^j*C(n, j).
a(n) ~ LambertW(1)*n^(n-1)/(1+LambertW(1)). - Vaclav Kotesovec, Aug 26 2016
MATHEMATICA
Rest[CoefficientList[Series[LambertW[-LambertW[-x]], {x, 0, 20}], x] * Range[0, 20]!] (* Vaclav Kotesovec, Aug 26 2016 *)
PROG
(PARI) x='x+O('x^50); Vec(serlaplace(lambertw(-lambertw(-x)))) \\ G. C. Greubel, Nov 15 2017
CROSSREFS
Sequence in context: A360524 A051784 A158046 * A334809 A325030 A191415
KEYWORD
nonn
AUTHOR
Ralf Stephan, Jul 30 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 23:53 EDT 2024. Contains 373535 sequences. (Running on oeis4.)