A036593 - OEIS

This site is supported by donations to The OEIS Foundation.

A036593

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

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

	OFFSET	`0,6`
	LINKS	`Table of n, a(n) for n=0..15.` `Index entries for sequences related to rooted trees` `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.`
	CROSSREFS	`Sequence in context: A196084 A008508 A163301 * A086674 A137203 A102890` `Adjacent sequences: A036590 A036591 A036592 * A036594 A036595 A036596`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane.`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified June 19 19:26 EDT 2013. Contains 226416 sequences.