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 A290364 #11 Jan 09 2019 15:48:31
%S A290364 0,1,42,817,8429,55627,268272,1030101,3331117,9425128,23970089,
%T A290364 55880968,121188860,247272012,478904297,886654486,1578265414,
%U A290364 2713745819,4525019252,7341094011,11619845543,17987638185,27288156478,40641967587,59518495595,85822255610
%N A290364 Number of 10-leaf rooted trees with n levels.
%H A290364 Alois P. Heinz, <a href="/A290364/b290364.txt">Table of n, a(n) for n = 0..1000</a>
%H A290364 B. A. Huberman and T. Hogg, <a href="https://doi.org/10.1016/0167-2789(86)90308-1">Complexity and adaptation</a>, Evolution, games and learning (Los Alamos, N.M., 1985). Phys. D 22 (1986), no. 1-3, 376-384.
%H A290364 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%H A290364 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (10,-45,120,-210,252,-210,120,-45,10,-1).
%F A290364 G.f.: (13*x^7+312*x^6+1835*x^5+3272*x^4+2029*x^3+442*x^2+32*x+1)*x / (x-1)^10.
%F A290364 a(n) = (7936*n^9 +4635*n^8 +24756*n^7 +43974*n^6 +65352*n^5 +60795*n^4 +81524*n^3 +72036*n^2 +1872*n)/9!.
%p A290364 a:= n-> ((((((((7936*n+4635)*n+24756)*n+43974)*n+65352)*n
%p A290364 +60795)*n+81524)*n+72036)*n+1872)*n/9!:
%p A290364 seq(a(n), n=0..40);
%t A290364 LinearRecurrence[{10,-45,120,-210,252,-210,120,-45,10,-1},{0,1,42,817,8429,55627,268272,1030101,3331117,9425128},30] (* _Harvey P. Dale_, Jan 09 2019 *)
%Y A290364 Row n=10 of A290353.
%K A290364 nonn,easy
%O A290364 0,3
%A A290364 _Alois P. Heinz_, Jul 28 2017