login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A246237 Number of rooted trees with n nodes and 8-colored non-root nodes. 2
0, 1, 8, 100, 1432, 22570, 377320, 6578116, 118238600, 2175619923, 40778137032, 775828919936, 14944103723856, 290858342628604, 5711285455910096, 113005043943326568, 2250850657029983808, 45095294493866921469, 908159403846847306568, 18373705506139825769712 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..500

Loïc Foissy, Algebraic structures on typed decorated rooted trees, arXiv:1811.07572 [math.RA], 2018.

FORMULA

a(n) ~ c * d^n / n^(3/2), where d = 21.9366222112987115910888213763759058905..., c = 0.05031446862451857508141944218348994381... . - Vaclav Kotesovec, Aug 26 2014

G.f. A(x) satisfies: A(x) = x*exp(8*Sum_{k>=1} A(x^k)/k). - Ilya Gutkovskiy, Mar 20 2018

MAPLE

with(numtheory):

a:= proc(n) option remember; `if`(n<2, n, (add(add(d*

      a(d), d=divisors(j))*a(n-j)*8, j=1..n-1))/(n-1))

    end:

seq(a(n), n=0..25);

MATHEMATICA

a[n_] := a[n] = If[n<2, n, Sum[Sum[d*a[d], {d, Divisors[j]}]*a[n-j]*8, {j, 1, n-1}]/(n-1)];

Table[a[n], {n, 0, 25}] (* Jean-François Alcover, Feb 23 2019, from Maple *)

CROSSREFS

Column k=8 of A242249.

Sequence in context: A144072 A261800 A208705 * A234513 A251686 A306032

Adjacent sequences:  A246234 A246235 A246236 * A246238 A246239 A246240

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Aug 19 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 02:01 EDT 2020. Contains 334581 sequences. (Running on oeis4.)