Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055302
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055302 Triangle of labeled rooted trees with n nodes and k leaves. +0
14
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; listen)
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 this_sequence A055349 A161174 A136656

Adjacent sequences: A055299 A055300 A055301 this_sequence A055303 A055304 A055305

KEYWORD

nonn,tabl,eigen

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research