id:A036593 - OEIS Search Results

Search: id:A036593

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 0, 0, 1, 3, 5, 7, 8, 9, 7, 7, 4, 3, 1, 1 (list; graph; listen)

	OFFSET	`0,6`
	LINKS	`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: A101496 A163301 A008508 this_sequence A086674 A137203 A102890` `Adjacent sequences: A036590 A036591 A036592 this_sequence A036594 A036595 A036596`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.005 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.