A001853 - OEIS

A001853

Total height of trees with n nodes.
(Formerly M2743 N1102)

0, 1, 3, 8, 22, 58, 158, 425, 1161, 3175, 8751, 24192, 67239, 187459, 524579, 1472086, 4142639, 11685501, 33036492, 93583873, 265589158, 754998424, 2149588878, 6128914829, 17497927510, 50017546412, 143137957590, 410062891934, 1175925220607, 3375322972597

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

REFERENCES

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

Alois P. Heinz, Table of n, a(n) for n = 1..300

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

J. Riordan, The enumeration of trees by height and diameter, IBM Journal 4 (1960), 473-478. (Annotated scanned copy)

Index entries for sequences related to trees

FORMULA

a(n) = Sum_{k=1..n-1} A034781(n,k)*k. - Sean A. Irvine, Mar 24 2016

CROSSREFS

Cf. A034781.

Sequence in context: A027243 A110239 A271893 * A217898 A003227 A291399

Adjacent sequences: A001850 A001851 A001852 * A001854 A001855 A001856

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Sean A. Irvine, Mar 24 2016

STATUS

approved