|
Search: id:A127539
|
|
|
| A127539 |
|
Number of ordered trees with n edges having no odd-length branches starting at the root. |
|
+0
3
|
|
| 1, 0, 1, 0, 3, 3, 16, 37, 134, 411, 1411, 4747, 16500, 57671, 204380, 730032, 2629637, 9535268, 34787215, 127585608, 470162614, 1739952061, 6463845941, 24096378885, 90112499714, 337965831635, 1270901550454, 4790836498608, 18100497143361
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
a(n)=A127538(n,0).
|
|
FORMULA
|
G.f.=(1+z)*C/(C+z), where C =[1-sqrt(1-4z)]/(2z) is the Catalan function.
|
|
EXAMPLE
|
a(3)=0 because all five ordered trees with 3 edges have at least one odd-length branch starting at the root.
|
|
MAPLE
|
C:=(1-sqrt(1-4*z))/2/z: G:=(1+z)*C/(C+z): Gser:=series(G, z=0, 35): seq(coeff(Gser, z, n), n=0..31);
|
|
CROSSREFS
|
Cf. A127538, A000958.
Adjacent sequences: A127536 A127537 A127538 this_sequence A127540 A127541 A127542
Sequence in context: A089403 A111674 A048234 this_sequence A014783 A095106 A130184
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 01 2007
|
|
|
Search completed in 0.002 seconds
|
