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.

A036587 Number of binary rooted trees with n nodes and height at most 4.

This page as a plain text file.
%I A036587 #15 Jul 08 2025 21:46:27
%S A036587 1,1,1,2,3,5,6,8,8,9,7,7,4,3,1,1
%N A036587 Number of binary rooted trees with n nodes and height at most 4.
%H A036587 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 A036587 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%K A036587 nonn,fini,full
%O A036587 0,4
%A A036587 _N. J. A. Sloane_