id:A036587 - OEIS Search Results

Search: id:A036587

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`0,4`
	LINKS	`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: A077674 A067077 A067183 this_sequence A075145 A086142 A039249` `Adjacent sequences: A036584 A036585 A036586 this_sequence A036588 A036589 A036590`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.