This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A001852 M4247 N1774 #26 Feb 04 2022 00:47:04
%S A001852 0,1,6,44,430,5322,79184,1381144,27730602,630422390,16006336852,
%T A001852 448982630340,13792542282974,460632431511826,16620059192605080,
%U A001852 644338908974954672,26713929408696716242,1179487563859389821166
%N A001852 Total diameter of labeled trees with n nodes.
%D A001852 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001852 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001852 J. Riordan, <a href="http://www.research.ibm.com/journal/rd/045/ibmrd0405E.pdf">Enumeration of trees by height and diameter</a>, IBM J. Res. Dev. 4 (1960), 473-478. [broken link]
%H A001852 J. Riordan, <a href="http://dx.doi.org/10.1147/rd.45.0473">Enumeration of trees by height and diameter</a>, IBM J. Res. Dev. 4 (1960), 473-478.
%H A001852 J. Riordan, <a href="/A007401/a007401_8.pdf">The enumeration of trees by height and diameter</a>, IBM Journal 4 (1960), 473-478. (Annotated scanned copy)
%H A001852 <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F A001852 a(1) = 0, a(2) = 1, a(n) = Sum_{k=2..n-1} A034854(n,k)*k. - _Sean A. Irvine_, Mar 24 2016
%Y A001852 Cf. A034854.
%K A001852 nonn
%O A001852 1,3
%A A001852 _N. J. A. Sloane_
%E A001852 More terms from _Sean A. Irvine_, Mar 24 2016