Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064781
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064781 Partially labeled rooted trees with n nodes (5 of which are labeled). +0
2
625, 7776, 60387, 373895, 2019348, 9941905, 45765687, 200160586, 840783867, 3418136039, 13525307849, 52314181361, 198451152867, 740283848220, 2721325964209, 9875523648986, 35429691205221, 125814678386528 (list; graph; listen)
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 this_sequence A055868 A106321 A016852

Adjacent sequences: A064778 A064779 A064780 this_sequence A064782 A064783 A064784

KEYWORD

nonn

AUTHOR

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

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 15 12:29 EDT 2010. Contains 173428 sequences.


AT&T Labs Research