id:A033185 - OEIS Search Results

Search: id:A033185

Displaying 1-1 of 1 results found.

page 1

Rooted tree triangle: a(n,k) = number of forests of k rooted trees and n nodes.

+0
9

1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 9, 6, 3, 1, 1, 20, 16, 7, 3, 1, 1, 48, 37, 18, 7, 3, 1, 1, 115, 96, 44, 19, 7, 3, 1, 1, 286, 239, 117, 46, 19, 7, 3, 1, 1, 719, 622, 299, 124, 47, 19, 7, 3, 1, 1, 1842, 1607, 793, 320, 126, 47, 19, 7, 3, 1, 1, 4766, 4235, 2095, 858, 327, 127, 47 (list; table; graph; listen)

	OFFSET	`1,4`
	LINKS	`Index entries for sequences related to rooted trees` `Index entries for sequences related to trees`
	FORMULA	`G.f.: 1/Product((1-x*y^i)^A000081(i), i=1..infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 28 2005` `a(n, k)= sum over the partitions of n, 1M1+2M2+...+nMn, with exactly k parts, of product_{1=<i<=n}C(A000081(i)+Mi-1, Mi). - Washington Bomfim (webonfim(AT)bol.com.br), May 12 2005`
	CROSSREFS	`Cf. A106240.` `Sequence in context: A092056 A103574 A112682 this_sequence A105632 A091491 A117418` `Adjacent sequences: A033182 A033183 A033184 this_sequence A033186 A033187 A033188`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research