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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055302 Triangle of labeled rooted trees with n nodes and k leaves. 13
1, 2, 0, 6, 3, 0, 24, 36, 4, 0, 120, 360, 140, 5, 0, 720, 3600, 3000, 450, 6, 0, 5040, 37800, 54600, 18900, 1302, 7, 0, 40320, 423360, 940800, 588000, 101136, 3528, 8, 0, 362880, 5080320, 16087680, 15876000, 5143824, 486864, 9144, 9, 0, 3628800 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

E.g.f. (relative to x) satisfies A(x, y)=xy+x*exp(A(x, y))-x. Divides by n and shifts up under exponential transform.

T(n, k) = (n!/k!)*Stirling2(n-1, n-k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 28 2004

EXAMPLE

1; 2,0; 6,3,0; 24,36,4,0; 120,360,140,5,0; ...

CROSSREFS

Row sums give A000169. Columns 1 through 12: A000142, A055303-A055313. Cf. A055314.

Sequence in context: A054877 A095834 A106828 * A055349 A161174 A136656

Adjacent sequences:  A055299 A055300 A055301 * A055303 A055304 A055305

KEYWORD

nonn,tabl,eigen

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), May 11 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.