|
Search: id:A161746
|
|
|
| A161746 |
|
The number of equivalence classes of n-leaf binary trees with respect to pattern avoidance. |
|
+0
1
|
| |
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Terms a(2) through a(8) coincide with terms 0 through 6 of A045629. However, this agreement does not continue, since a(9) is in the range 133 <= a(9) <= 139.
|
|
LINKS
|
Eric S. Rowland, Pattern avoidance in binary trees.
|
|
EXAMPLE
|
Representatives of the a(6) = 7 equivalence classes of 6-leaf binary trees are given in A036766, A159768, A159769, A159770, A159771, A159772, and A159773.
|
|
CROSSREFS
|
Sequence in context: A052321 A114584 A039826 this_sequence A045629 A034731 A110888
Adjacent sequences: A161743 A161744 A161745 this_sequence A161747 A161748 A161749
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Eric S Rowland (erowland(AT)math.rutgers.edu), Jun 17 2009
|
|
|
Search completed in 0.002 seconds
|
