id:A036371 - OEIS Search Results

Search: id:A036371

Displaying 1-1 of 1 results found.

page 1

Number of ternary rooted trees with n nodes and height at most 3.

+0
1

1, 1, 1, 2, 3, 4, 4, 5, 4, 4, 3, 2, 1, 1 (list; graph; listen)

	OFFSET	`0,4`
	LINKS	`Index entries for sequences related to rooted trees`
	FORMULA	`If T_i(z) = g.f. for ternary trees of height at most i, T_{i+1}(z)=1+z(T_i(z)^3/6+T_i(z^2)T_i(z)/2+T_i(z^3)/3); T_0(z) = 1.`
	CROSSREFS	`Sequence in context: A058277 A065852 A088807 this_sequence A036370 A005208 A110007` `Adjacent sequences: A036368 A036369 A036370 this_sequence A036372 A036373 A036374`
	KEYWORD	`nonn,full,fini`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), E. M. Rains (rains(AT)caltech.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.