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 A036422 #13 Oct 31 2020 17:19:26 %S A036422 0,0,0,0,0,0,0,1,6,26,88,267,743,1968,5006,12394,29984,71289,166927, %T A036422 386042,882887,1999964,4491226,10008151,22144282,48681992,106384313, %U A036422 231200051,499868227,1075542674,2303703530,4913213715,10436198873 %N A036422 Number of ternary rooted trees with n nodes and height exactly 7. %H A036422 Sean A. Irvine, <a href="/A036422/b036422.txt">Table of n, a(n) for n = 0..1093</a> %H A036422 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %F A036422 a(n) = A036375(n) - A036374(n). - _Sean A. Irvine_, Oct 31 2020 %Y A036422 Cf. A036370, A036437. %K A036422 nonn,fini,full %O A036422 0,9 %A A036422 _N. J. A. Sloane_, Eric Rains (rains(AT)caltech.edu)