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 A055279 #18 Mar 05 2022 04:20:03
%S A055279 1,4,14,39,97,212,429,804,1427,2406,3900,6094,9245,13645,19682,27791,
%T A055279 38530,52516,70521,93390,122157,157945,202104,256090,321628,400567,
%U A055279 495070,607445,740362,896657,1079581,1292574,1539546,1824621,2152452,2527932,2956546
%N A055279 Number of rooted trees with n nodes and 4 leaves.
%H A055279 Georg Fischer, <a href="/A055279/b055279.txt">Table of n, a(n) for n = 5..200</a>
%H A055279 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A055279 G.f.: x^5 * (1 + x + 3*x^2 + 5*x^3 + 7*x^4 + 5*x^5 + 5*x^6 + 2*x^7 + x^8) / ((1 - x)^3 * (1 - x^2)^2 * (1 - x^3) * (1 - x^4)). - _Michael Somos_, Nov 02 2014
%F A055279 a(5-n) = A055365(n). for all n in Z. - _Michael Somos_, Nov 02 2014
%F A055279 0 = -30 + a(n) - 2*a(n+1) - a(n+2) + 3*a(n+3) + a(n+5) - 2*a(n+6) - 2*a(n+7) + a(n+8) + 3*a(n+10) - a(n+11) - 2*a(n+12) + a(n+13) for all n in Z. - _Michael Somos_, Nov 02 2014
%F A055279 a(n) ~ n^6 / 1152 as n -> infinity. - _Michael Somos_, Nov 02 2014
%e A055279 G.f. = x^5 + 4*x^6 + 14*x^7 + 39*x^8 + 97*x^9 + 212*x^10 + 429*x^11 + ...
%o A055279 (PARI) {a(n) = if( n<5, n = -1-n; polcoeff( (1 + 2*x + 5*x^2 + 5*x^3 + 7*x^4 + 5*x^5 + 3*x^6 + x^7 + x^8) / ((1 - x)^3 * (1 - x^2)^2 * (1 - x^3) * (1 - x^4)) + x * O(x^n), n), n = n-5; polcoeff( (1 + x + 3*x^2 + 5*x^3 + 7*x^4 + 5*x^5 + 5*x^6 + 2*x^7 + x^8) / ((1 - x)^3 * (1 - x^2)^2 * (1 - x^3) * (1 - x^4)) + x * O(x^n), n))}; /* _Michael Somos_, Nov 02 2014 */
%Y A055279 Column 4 of A055277.
%Y A055279 Cf. A055365.
%K A055279 nonn
%O A055279 5,2
%A A055279 _Christian G. Bower_, May 09 2000