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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000555 Number of labeled trees of diameter 4 with n nodes.
(Formerly M5319 N2312)
0
60, 720, 6090, 47040, 363384, 2913120, 24560910, 218386080, 2044958916, 20112075984, 207161237010, 2228884869120, 24989300398320, 291322535242176, 3524580157816854, 44176838981652000, 572725044049055100, 7668896804089696560, 105920137922879314650, 1507138839384235136640, 22068265782102952223400, 332178010291171425732000, 5135009134117954527323550, 81449458937043220255508640 (list; graph; refs; listen; history; internal format)
OFFSET

5,1

REFERENCES

J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Index entries for sequences related to trees

FORMULA

a(n)=A000551(n)-n*(n-1)*(2^(n-2)-1)

CROSSREFS

Sequence in context: A099344 A088945 A136008 * A034865 A138409 A024016

Adjacent sequences:  A000552 A000553 A000554 * A000556 A000557 A000558

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms and formula from Sean A. Irvine (sairvin(AT)xtra.co.nz), Nov 22 2010

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 02:39 EST 2012. Contains 205567 sequences.