id:A036376 - OEIS Search Results

Search: id:A036376

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 1, 1, 2, 4, 8, 17, 39, 89, 210, 498, 1185, 2813, 6664, 15707, 36886, 86259, 201003, 466788, 1080825, 2495565, 5747664, 13206253, 30276788, 69267205, 158155198, 360422113, 819873747, 1861732042, 4220347570, 9551287776 (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`
	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: A132043 A055545 A036375 this_sequence A000598 A003008 A054199` `Adjacent sequences: A036373 A036374 A036375 this_sequence A036377 A036378 A036379`
	KEYWORD	`nonn,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 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research