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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A244464 Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10. 3
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 30, 34, 39, 43, 52, 65, 88, 121, 165, 219, 285, 360, 447, 544, 661, 805, 998, 1256, 1613, 2085, 2709, 3500, 4496, 5709, 7201, 9016, 11277, 14108, 17738, 22410, 28484, 36330 (list; graph; refs; listen; history; text; internal format)
OFFSET

11,12

LINKS

Alois P. Heinz, Table of n, a(n) for n = 11..900

MAPLE

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

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

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

    end:

a:= n-> b(n-1$2, 10$2) -b(n-1$2, 11$2):

seq(a(n), n=11..80);

CROSSREFS

Column k=10 of A244454.

Cf. A244539.

Sequence in context: A032574 A058515 A126696 * A250201 A252375 A339170

Adjacent sequences:  A244461 A244462 A244463 * A244465 A244466 A244467

KEYWORD

nonn

AUTHOR

Joerg Arndt and Alois P. Heinz, Jun 29 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 January 18 05:18 EST 2021. Contains 340250 sequences. (Running on oeis4.)