|
Search: id:A050352
|
|
|
| A050352 |
|
Number of 4-level labeled linear rooted trees with n leaves. |
|
+0
4
|
|
| 1, 1, 7, 73, 1015, 17641, 367927, 8952553, 248956855, 7788499561, 270732878647, 10351919533033, 431806658432695, 19512813265643881, 949587798053709367, 49512355251796513513, 2753726282896986372535, 162725978752448205162601
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Index entries for sequences related to rooted trees
|
|
FORMULA
|
E.g.f.: (3-2*e^x)/(4-3*e^x).
a(n) is asymptotic to (1/12)*n!/log(4/3)^(n+1). - Benoit Cloitre, Jan 30 2003
For m-level trees (m>1), e.g.f. is (m-1-(m-2)*e^x)/(m-(m-1)*e^x), and number of trees is 1/(m*(m-1))*sum(k>=0, (1-1/m)^k*k^n). Here m=4, so a(n)=(1/12)*sum(k>=0, (3/4)^k*k^n) (for n>0). - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 30 2003
|
|
PROGRAM
|
(PARI) a(n)=n!*if(n<0, 0, polcoeff((3-2*exp(x))/(4-3*exp(x))+O(x^(n+1)), n))
|
|
CROSSREFS
|
Cf. A000670, A050351-A050359.
Equals 1/3 * A032033(n) for n>0.
Adjacent sequences: A050349 A050350 A050351 this_sequence A050353 A050354 A050355
Sequence in context: A114429 A124547 A084363 this_sequence A112939 A048174 A058350
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Oct 15 1999.
|
|
|
Search completed in 0.002 seconds
|
