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 A036375 #23 Oct 29 2020 03:26:18
%S A036375 1,1,1,2,4,8,17,39,88,203,464,1056,2381,5344,11900,26381,58165,127713,
%T A036375 279209,608213,1319985,2855275,6155981,13231553,28353787,60583959,
%U A036375 129084369,274283708,581244959,1228514486,2589902750,5446168197
%N A036375 Number of ternary rooted trees with n nodes and height at most 7.
%H A036375 Sean A. Irvine, <a href="/A036375/b036375.txt">Table of n, a(n) for n = 0..1093</a>
%H A036375 E. M. Rains and N. J. A. Sloane, <a href="https://cs.uwaterloo.ca/journals/JIS/cayley.html">On Cayley's Enumeration of Alkanes (or 4-Valent Trees)</a>, J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.
%H A036375 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A036375 If T_i(z) = g.f. for ternary trees of height at most i, T_{i+1}(z)=1+z*(T_i(z)^3/6+T_i(z^2)*T_i(z)/2+T_i(z^3)/3); T_0(z) = 1.
%t A036375 T[0] = {1}; T[n_] := T[n] = Module[{f, g}, f[z_] := Sum[T[n - 1][[i]]*z^(i - 1), {i, 1, Length[T[n - 1]]}]; g = 1 + z*(f[z]^3/6 + f[z^2]*f[z]/2 + f[z^3]/3); CoefficientList[g, z]]; A036375 = T[7] (* _Jean-François Alcover_, Jan 19 2016, after _Alois P. Heinz_ (A036370) *)
%Y A036375 Cf. A036370.
%K A036375 nonn,fini,full
%O A036375 0,4
%A A036375 _N. J. A. Sloane_, E. M. Rains (rains(AT)caltech.edu)