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 A055304 #23 Sep 08 2022 08:45:01
%S A055304 4,140,3000,54600,940800,16087680,279417600,4989600000,92207808000,
%T A055304 1769511744000,35321737651200,733823266176000,15866448998400000,
%U A055304 356873052856320000,8344427063132160000,202660737281114112000
%N A055304 Number of labeled rooted trees with n nodes and 3 leaves.
%H A055304 Vincenzo Librandi, <a href="/A055304/b055304.txt">Table of n, a(n) for n = 4..200</a>
%H A055304 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A055304 a(n) = (n!/3!)*Stirling2(n-1, n-3). - _Vladeta Jovovic_, Jan 28 2004
%F A055304 a(n) = n! * (n-3)*(n-2)*(n-1)*(3*n-8)/144. - _Vaclav Kotesovec_, Jul 25 2014
%F A055304 E.g.f.: x^4*(2*x+1)/(6*(1-x)^5). - _Robert Israel_, Jul 25 2014
%p A055304 seq(n!*(n-3)*(n-2)*(n-1)*(3*n-8)/144, n=4..100); # _Robert Israel_, Jul 25 2014
%t A055304 Table[n! * (n-3)*(n-2)*(n-1)*(3*n-8)/144,{n,4,20}] (* _Vaclav Kotesovec_, Jul 25 2014 *)
%o A055304 (Magma) [Factorial(n)*(n-3)*(n-2)*(n-1)*(3*n-8)/144 : n in [4..25]]; // _Vincenzo Librandi_, Jul 25 2014
%Y A055304 Column 3 of A055302.
%K A055304 nonn
%O A055304 4,1
%A A055304 _Christian G. Bower_, May 11 2000