cp's OEIS Frontend

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.

A036588 Number of binary rooted trees with n nodes and height at most 5.

This page as a plain text file.
%I A036588 #15 Jul 08 2025 21:46:34
%S A036588 1,1,1,2,3,6,10,17,25,38,52,73,93,121,143,172,187,205,202,201,177,158,
%T A036588 123,99,66,47,26,17,7,4,1,1
%N A036588 Number of binary rooted trees with n nodes and height at most 5.
%H A036588 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 A036588 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%K A036588 nonn,fini,full
%O A036588 0,4
%A A036588 _N. J. A. Sloane_