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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055290 Triangle of trees with n nodes and k leaves. 12
1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 2, 1, 0, 1, 3, 4, 2, 1, 0, 1, 4, 8, 6, 3, 1, 0, 1, 5, 14, 14, 9, 3, 1, 0, 1, 7, 23, 32, 26, 12, 4, 1, 0, 1, 8, 36, 64, 66, 39, 16, 4, 1, 0, 1, 10, 54, 123, 158, 119, 60, 20, 5, 1, 0, 1, 12, 78, 219, 350, 325, 202, 83, 25, 5, 1, 0, 1, 14, 110, 377, 727 (list; table; graph; refs; listen; history; internal format)
OFFSET

2,12

REFERENCES

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 80, Problem 3.9.

LINKS

Index entries for sequences related to trees

FORMULA

G.f.: A(x, y)=(1-x+x*y)*B(x, y)+(1/2)*(B(x^2, y^2)-B(x, y)^2). B(x, y): g.f. of A055277.

EXAMPLE

1; 1,0; 1,1,0; 1,1,1,0; 1,2,2,1,0; ...

CROSSREFS

Row sums give A000055. Columns 3 through 12: A001399(n-4), A055291-A055299. Cf. A055300, A055301.

Sequence in context: A037836 A194522 A165013 * A125629 A141335 A133624

Adjacent sequences:  A055287 A055288 A055289 * A055291 A055292 A055293

KEYWORD

nonn,tabl

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), May 09 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 17:41 EST 2012. Contains 205651 sequences.