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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064781 Partially labeled rooted trees with n nodes (5 of which are labeled). 1
625, 7776, 60387, 373895, 2019348, 9941905, 45765687, 200160586, 840783867, 3418136039, 13525307849, 52314181361, 198451152867, 740283848220, 2721325964209, 9875523648986, 35429691205221, 125814678386528 (list; graph; refs; listen; history; internal format)
OFFSET

5,1

REFERENCES

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 134.

FORMULA

G.f.: A(x) = B(x)^5*(625-974*B(x)+622*B(x)^2-192*B(x)^3+24*B(x)^4)/(1-B(x))^9, where B(x) is g.f. for rooted trees with n nodes, cf. A000081.

CROSSREFS

Cf. A000081, A000107, A000524, A000444, A000525, A042977.

Sequence in context: A016816 A046756 A143026 * A055868 A106321 A016852

Adjacent sequences:  A064778 A064779 A064780 * A064782 A064783 A064784

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 19 2001

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 17 14:44 EST 2012. Contains 206045 sequences.