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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001851 Total diameter of unlabeled trees with n nodes.
(Formerly M1363 N0527)
0
0, 1, 2, 5, 9, 21, 44, 103, 232, 571, 1368, 3441, 8653, 22263, 57518, 150733, 396937, 1054540, 2815453, 7562159, 20399714, 55280532, 150356806, 410432671, 1123902587, 3086827578, 8500975970, 23470712241, 64952794778, 180144093389 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

C program around function Gen() by Gang Li & Frank Ruskey. See C program link.

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

Table of n, a(n) for n=1..30.

Index entries for sequences related to trees

J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478. [From Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 26 2010]

W. Bomfim, Diameters of the trees of order 6

W. Bomfim, C program

EXAMPLE

See the trees in first Bomfim link. So a(6) = 21.

CROSSREFS

Sequence in context: A097163 A117186 A155042 * A024822 A218966 A029726

Adjacent sequences:  A001848 A001849 A001850 * A001852 A001853 A001854

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 26 2010. a(21)-a(30) from W. Bomfim, jan 31 2011.

STATUS

approved

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 May 24 02:16 EDT 2013. Contains 225613 sequences.