|
Search: id:A052525
|
|
|
| A052525 |
|
Number of unlabeled rooted trees with n leaves in which the degrees of the root and all internal nodes are >= 3. |
|
+0
2
|
|
| 0, 0, 0, 1, 1, 2, 3, 6, 10, 20, 36, 71, 136, 270, 531, 1070, 2147, 4367, 8895, 18262, 37588, 77795, 161444, 336383, 702732, 1472582, 3093151, 6513402, 13744384, 29063588, 61570853, 130669978, 277767990, 591373581, 1260855164
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
Old name was "Non-planar unlabeled trees with neither unary nor binary nodes". I am leaving this alternative name here because it may help clarify the definitions of related sequences. - N. J. A. Sloane (njas(AT)research.att.com).
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 95
|
|
EXAMPLE
|
For instance, with 7 leaves, the 6 choices are:
. [ *,*,*,*,*,*,* ]
. [ *,*,*,*,[ *,*,* ] ]
. [ *,*,*,[ *,*,*,* ] ]
. [ *,*,[ *,*,*,*,* ] ]
. [ *,*,[ *,*,[ *,*,* ] ] ]
. [ *,[ *,*,* ],[ *,*,* ] ]
|
|
MAPLE
|
spec := [ S, {B=Union(S, Z), S=Set(B, 3 <= card)}, unlabeled ]: seq(combstruct[ count ](spec, size=n), n=0..50);
|
|
CROSSREFS
|
Cf. A052524 and A052526.
Sequence in context: A036557 A047131 A008927 this_sequence A006606 A120421 A005418
Adjacent sequences: A052522 A052523 A052524 this_sequence A052526 A052527 A052528
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
EXTENSIONS
|
More terms from Paul.Zimmermann(AT)loria.fr, Oct 31 2002
|
|
|
Search completed in 0.004 seconds
|
