login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A292555 Number of rooted unlabeled trees on n nodes where each node has at most 10 children. 10
1, 1, 1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4765, 12483, 32964, 87785, 235305, 634628, 1720524, 4686842, 12820920, 35206475, 97010705, 268154003, 743351390, 2066090876, 5756490561, 16074597300, 44980514021, 126109353817, 354202275766, 996517941454 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

Marko Riedel, Trees with bounded degree.

FORMULA

Functional equation of G.f. is T(z) = z + z*Sum_{q=1..10} Z(S_q)(T(z)) with Z(S_q) the cycle index of the symmetric group. Alternate FEQ is

T(z) = 1 + z*Z(S_10)(T(z)).

a(n) = Sum_{j=1..10} A244372(n,j) for n>0, a(0) = 1. - Alois P. Heinz, Sep 20 2017

MAPLE

b:= proc(n, i, t, k) option remember; `if`(n=0, 1,

      `if`(i<1, 0, add(binomial(b((i-1)$2, k$2)+j-1, j)*

       b(n-i*j, i-1, t-j, k), j=0..min(t, n/i))))

    end:

a:= n-> `if`(n=0, 1, b(n-1$2, 10$2)):

seq(a(n), n=0..35);  # Alois P. Heinz, Sep 20 2017

CROSSREFS

Cf. A000081, A001190, A000598, A036718, A036721, A036722, A182378, A244372, A292553, A292554, A292556.

Sequence in context: A255640 A216403 A145548 * A145549 A292556 A145550

Adjacent sequences:  A292552 A292553 A292554 * A292556 A292557 A292558

KEYWORD

nonn

AUTHOR

Marko Riedel, Sep 18 2017

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified January 22 10:32 EST 2018. Contains 298042 sequences.