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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000554 Number of labeled trees of diameter 3 with n nodes.
(Formerly M4843 N2070)
1
12, 60, 210, 630, 1736, 4536, 11430, 28050, 67452, 159588, 372554, 859950, 1965840, 4456176, 10026702, 22412970, 49806980, 110100060, 242220594, 530578950, 1157627352, 2516581800, 5452594550, 11777604930, 25367149836, 54492396756 (list; graph; refs; listen; history; internal format)
OFFSET

4,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) = n(n-1)*S2(n-2, 2) where S2(n, k) denotes the Stirling numbers of 2nd kind -Victor Adamchik (adamchik(AT)cs.cmu.edu), Jul 19 2001

a(n) = n(n-1) * 2^(n-3) = 2*A000217(n-1)*A000225(n-3) - Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 01 2007

MATHEMATICA

f[n_] := n (n - 1)*StirlingS2[n - 2, 2]; Table[ f@n, {n, 4, 29}] - Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 01 2007

CROSSREFS

Sequence in context: A174642 A061624 A004302 * A012289 A012583 A009049

Adjacent sequences:  A000551 A000552 A000553 * A000555 A000556 A000557

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 01 2007

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 15 11:56 EST 2012. Contains 205780 sequences.