Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055304
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055304 Number of labeled rooted trees with n nodes and 3 leaves. +0
1
4, 140, 3000, 54600, 940800, 16087680, 279417600, 4989600000, 92207808000, 1769511744000, 35321737651200, 733823266176000, 15866448998400000, 356873052856320000, 8344427063132160000, 202660737281114112000 (list; graph; listen)
OFFSET

4,1

LINKS

Index entries for sequences related to rooted trees

FORMULA

(n!/3!)*Stirling2(n-1, n-3). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 28 2004

CROSSREFS

Column 3 of A055302.

Sequence in context: A089666 A029850 A093981 this_sequence A002917 A119038 A048432

Adjacent sequences: A055301 A055302 A055303 this_sequence A055305 A055306 A055307

KEYWORD

nonn

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research