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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001853 Total height of trees with n nodes.
(Formerly M2743 N1102)
0
0, 1, 3, 8, 22, 58, 158, 425, 1161, 3175, 8751, 24192, 67239 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

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..13.

Index entries for sequences related to trees

CROSSREFS

Sequence in context: A020962 A027243 A110239 * A217898 A003227 A077848

Adjacent sequences:  A001850 A001851 A001852 * A001854 A001855 A001856

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 10 18:27 EDT 2015. Contains 261502 sequences.