id:A036772 - OEIS Search Results

Search: id:A036772

Displaying 1-1 of 1 results found.

page 1

Number of labeled rooted trees with a degree constraint: (4*n)!/(24^n))*binomial(4*n+1,n).

+0
1

1, 5, 2520, 9909900, 150089940000, 6217438242015000, 574985352122181000000, 103753754577643425255000000, 33189544956070738228953960000000, 17517292900368819935211385551000000000 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`L. Takacs, Enumeration of rooted trees and forests, Math. Scientist 18 (1993), 1-10, esp. Eq. (12).`
	LINKS	`Index entries for sequences related to rooted trees`
	CROSSREFS	`Sequence in context: A074799 A067944 A114716 this_sequence A117011 A096934 A076912` `Adjacent sequences: A036769 A036770 A036771 this_sequence A036773 A036774 A036775`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research