This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001852 Total diameter of labeled trees with n nodes. (Formerly M4247 N1774) 1
 0, 1, 6, 44, 430, 5322, 79184, 1381144, 27730602, 630422390, 16006336852, 448982630340, 13792542282974, 460632431511826, 16620059192605080, 644338908974954672, 26713929408696716242, 1179487563859389821166 (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 J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478. FORMULA a(1) = 0, a(2) = 1, a(n) = Sum_{k=2..n-1} A034854(n,k)*k. - Sean A. Irvine, Mar 24 2016 CROSSREFS Cf. A034854. Sequence in context: A203159 A124996 A226045 * A194928 A267074 A271963 Adjacent sequences:  A001849 A001850 A001851 * A001853 A001854 A001855 KEYWORD nonn AUTHOR EXTENSIONS More terms from Sean A. Irvine, Mar 24 2016 STATUS approved

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