id:A001384 - OEIS Search Results

Search: id:A001384

Displaying 1-1 of 1 results found.

page 1

Number of n-node trees of height at most 4.
(Formerly M1172 N0449)

+0
4

1, 1, 1, 2, 4, 9, 19, 42, 89, 191, 402, 847, 1763, 3667, 7564, 15564, 31851, 64987, 132031, 267471, 539949, 1087004, 2181796, 4367927, 8721533, 17372967, 34524291, 68456755, 135446896, 267444085, 527027186, 1036591718, 2035083599 (list; graph; listen)

	OFFSET	`0,4`
	REFERENCES	`J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.`
	LINKS	`N. J. A. Sloane, Table of n, a(n) for n=0..200` `INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 63` `N. J. A. Sloane, Transforms` `Index entries for sequences related to rooted trees` `Index entries for sequences related to trees`
	FORMULA	`Take Euler transform of A001383 and shift right. (Christian G. Bower (bowerc(AT)usa.net)).`
	MAPLE	`For Maple program see link in A000235.`
	CROSSREFS	`See A001383 for details.` `Adjacent sequences: A001381 A001382 A001383 this_sequence A001385 A001386 A001387` `Sequence in context: A122584 A078039 A036622 this_sequence A089941 A127681 A112569`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research