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 A036592 #17 Jul 08 2025 21:47:03 %S A036592 1,1,1,2,3,6,11,23,46,98,206,441,928,1951,4046,8349,17062,34703,70112, %T A036592 141071,282420,563333,1119020,2215310,4369699,8591513,16836216, %U A036592 32891454,64057841,124388194,240827283,464938673,895070853,1718386387 %N A036592 Number of binary rooted trees with n nodes and height at most 9. %H A036592 Alois P. Heinz, <a href="/A036592/b036592.txt">Table of n, a(n) for n = 0..511</a> %H A036592 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 A036592 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %K A036592 nonn,fini,full %O A036592 0,4 %A A036592 _N. J. A. Sloane_