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 A036421 #13 Oct 31 2020 17:16:45 %S A036421 0,0,0,0,0,0,1,5,19,56,151,374,889,2032,4529,9858,21075,44320,91928, %T A036421 188288,381392,764683,1519026,2991601,5844950,11334761,21827329, %U A036421 41755112,79376196,149991258,281805933,526546799,978614867,1809450608 %N A036421 Number of ternary rooted trees with n nodes and height exactly 6. %H A036421 Sean A. Irvine, <a href="/A036421/b036421.txt">Table of n, a(n) for n = 0..364</a> %H A036421 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %F A036421 a(n) = A036374(n) - A036373(n). - _Sean A. Irvine_, Oct 31 2020 %Y A036421 Cf. A036370, A036437. %K A036421 nonn,fini,full %O A036421 0,8 %A A036421 _N. J. A. Sloane_, Eric Rains (rains(AT)caltech.edu)