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 A001853 M2743 N1102 #27 Feb 04 2022 00:46:55
%S A001853 0,1,3,8,22,58,158,425,1161,3175,8751,24192,67239,187459,524579,
%T A001853 1472086,4142639,11685501,33036492,93583873,265589158,754998424,
%U A001853 2149588878,6128914829,17497927510,50017546412,143137957590,410062891934,1175925220607,3375322972597
%N A001853 Total height of trees with n nodes.
%D A001853 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001853 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001853 Alois P. Heinz, <a href="/A001853/b001853.txt">Table of n, a(n) for n = 1..300</a>
%H A001853 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 A001853 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 A001853 <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F A001853 a(n) = Sum_{k=1..n-1} A034781(n,k)*k. - _Sean A. Irvine_, Mar 24 2016
%Y A001853 Cf. A034781.
%K A001853 nonn
%O A001853 1,3
%A A001853 _N. J. A. Sloane_
%E A001853 More terms from _Sean A. Irvine_, Mar 24 2016