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 A036423 #13 Oct 31 2020 17:19:51 %S A036423 0,0,0,0,0,0,0,0,1,7,34,129,432,1320,3807,10505,28094,73290,187579, %T A036423 472612,1175580,2892389,7050272,17045235,40913418,97571239,231337744, %U A036423 545590039,1280487083,2991833084,6961385026,16135193088,37263361364 %N A036423 Number of ternary rooted trees with n nodes and height exactly 8. %H A036423 Sean A. Irvine, <a href="/A036423/b036423.txt">Table of n, a(n) for n = 0..3280</a> %H A036423 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %F A036423 a(n) = A036376(n) - A036375(n). - _Sean A. Irvine_, Oct 31 2020 %Y A036423 Cf. A036370, A036437. %K A036423 nonn,fini,full %O A036423 0,10 %A A036423 _N. J. A. Sloane_, Eric Rains (rains(AT)caltech.edu)