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!)
A246238 Number of rooted trees with n nodes and 9-colored non-root nodes. 2
0, 1, 9, 126, 2028, 35919, 674964, 13225632, 267188229, 5525568297, 116400215521, 2488984609644, 53883301460607, 1178671076752803, 26011822261355487, 578441979200964897, 12948907700868521142, 291569232606979152321, 6599274332502483541080 (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 = 24.654188324989308481297681284616076174..., c = 0.044677658292795889027452779147731609565... . - Vaclav Kotesovec, Aug 26 2014

G.f. A(x) satisfies: A(x) = x*exp(9*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)*9, 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]*9, {j, 1, n-1}]/(n-1)];

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

CROSSREFS

Column k=9 of A242249.

Sequence in context: A144073 A261801 A065086 * A234573 A306033 A065707

Adjacent sequences:  A246235 A246236 A246237 * A246239 A246240 A246241

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 July 5 20:21 EDT 2020. Contains 335473 sequences. (Running on oeis4.)