|
| |
|
|
A036772
|
|
Number of labeled rooted trees with a degree constraint: (4*n)!/(24^n))*binomial(4*n+1,n).
|
|
0
| |
|
|
1, 5, 2520, 9909900, 150089940000, 6217438242015000, 574985352122181000000, 103753754577643425255000000, 33189544956070738228953960000000, 17517292900368819935211385551000000000
(list; graph; refs; listen; history; internal format)
|
|
|
|
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
|
|
|
FORMULA
| E.g.f. A(x) satisfies A(x)=1+1/24*(x*A(x))^4. [From Vladimir Kruchinin, Nov 22 2011 ]
|
|
|
MATHEMATICA
| Table[(4n)!/24^n Binomial[4n+1, n], {n, 0, 10}] (* From Harvey P. Dale, Aug 10 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A067944 A200916 A114716 * A117011 A096934 A076912
Adjacent sequences: A036769 A036770 A036771 * A036773 A036774 A036775
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
