A036587 - OEIS

This site is supported by donations to The OEIS Foundation.

A036587

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

1, 1, 1, 2, 3, 5, 6, 8, 8, 9, 7, 7, 4, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,4`
	LINKS	`Table of n, a(n) for n=0..15.` `E. M. Rains and N. J. A. Sloane, On Cayley's Enumeration of Alkanes (or 4-Valent Trees)., J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.` `Index entries for sequences related to rooted trees`
	CROSSREFS	`Sequence in context: A067077 A067183 A269670 * A075145 A086142 A258334` `Adjacent sequences: A036584 A036585 A036586 * A036588 A036589 A036590`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane.`
	STATUS	`approved`

Last modified February 19 10:18 EST 2019. Contains 320310 sequences. (Running on oeis4.)