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 A036590 #17 Jul 08 2025 21:46:48 %S A036590 1,1,1,2,3,6,11,23,45,90,171,325,598,1097,1972,3531,6225,10915,18898, %T A036590 32507,55302,93410,156208,259250,426227,695235,1123742,1801614, %U A036590 2862591,4510432,7043455,10904830,16731444,25446285,38349306,57278489 %N A036590 Number of binary rooted trees with n nodes and height at most 7. %H A036590 Alois P. Heinz, <a href="/A036590/b036590.txt">Table of n, a(n) for n = 0..127</a> %H A036590 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 A036590 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %K A036590 nonn,fini,full %O A036590 0,4 %A A036590 _N. J. A. Sloane_