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 A000555 M5319 N2312 #27 Feb 10 2016 03:44:12
%S A000555 60,720,6090,47040,363384,2913120,24560910,218386080,2044958916,
%T A000555 20112075984,207161237010,2228884869120,24989300398320,
%U A000555 291322535242176,3524580157816854,44176838981652000,572725044049055100,7668896804089696560,105920137922879314650,1507138839384235136640,22068265782102952223400,332178010291171425732000,5135009134117954527323550,81449458937043220255508640
%N A000555 Number of labeled trees of diameter 4 with n nodes.
%D A000555 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000555 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000555 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 A000555 <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F A000555 a(n)=A000551(n)-n*(n-1)*(2^(n-2)-1). - _Sean A. Irvine_, Nov 22 2010
%t A000555 a[n_] = n(n-1)(Sum[k^(n-k-2)*Binomial[n-2, k-1], {k, n-2}] - 2^(n-2) + 1); Table[a[n], {n, 5, 30}] (* _Jean-François Alcover_, Feb 10 2016, after _Sean A. Irvine_ *)
%K A000555 nonn
%O A000555 5,1
%A A000555 _N. J. A. Sloane_
%E A000555 More terms from _Sean A. Irvine_, Nov 22 2010