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 A036589 #17 Jul 08 2025 21:46:41 %S A036589 1,1,1,2,3,6,11,22,39,70,118,200,324,526,825,1290,1958,2952,4335,6305, %T A036589 8948,12547,17183,23200,30593,39697,50305,62641,76157,90883,105860, %U A036589 120915,134719,147040,156412,162812,164968,163377,157278 %N A036589 Number of binary rooted trees with n nodes and height at most 6. %H A036589 Alois P. Heinz, <a href="/A036589/b036589.txt">Table of n, a(n) for n = 0..63</a> %H A036589 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 A036589 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %K A036589 nonn,fini,full %O A036589 0,4 %A A036589 _N. J. A. Sloane_