Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064782
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064782 Partially labeled rooted trees with n nodes (6 of which are labeled). +0
2
7776, 117649, 1071904, 7601777, 46205469, 252620693, 1277843841, 6088987597, 27669884619, 120970585689, 512143134419, 2110092318654, 8493720340735, 33506301271642, 129860760881905, 495506657571553, 1864611086321279 (list; graph; listen)
OFFSET

6,1

REFERENCES

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

FORMULA

G.f.: A(x) = B(x)^6*(7776-14543*B(x)+11758*B(x)^2-5126*B(x)^3+1200*B(x)^4-120*B(x)^5)/(1-B(x))^11, 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: A115440 A028538 A123990 this_sequence A016865 A016913 A017057

Adjacent sequences: A064779 A064780 A064781 this_sequence A064783 A064784 A064785

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research