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!)
A244539 Number of ordered 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, 10, 21, 22, 23, 24, 25, 26, 27, 28, 29, 175, 496, 1024, 1617, 2278, 3010, 3816, 4699, 5662, 6708, 10310, 19721, 39074, 73487, 125862, 199365, 297436, 423799, 582472, 777777, 1060410, 1547051, 2443649, 4072732, 6905106, 11528110 (list; graph; refs; listen; history; text; internal format)
OFFSET

11,11

LINKS

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

MAPLE

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

      `if`(t in [0, k], 1, 0), `if`(t>n, 0, add(b(j-1, k$2)*

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

    end:

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

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

CROSSREFS

Column k=10 of A244530.

Cf. A244464.

Sequence in context: A128536 A202318 A251128 * A335236 A164712 A336558

Adjacent sequences:  A244536 A244537 A244538 * A244540 A244541 A244542

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 July 31 04:50 EDT 2021. Contains 346367 sequences. (Running on oeis4.)