login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159768 Number of n-leaf binary trees that do not contain (()(()(()((()())())))) as a subtree. 1
1, 1, 2, 5, 14, 41, 124, 385, 1221, 3939, 12886, 42648, 142544, 480459, 1631287, 5574073, 19153815, 66146259, 229452587, 799140681, 2793373937, 9796395680, 34459558856, 121548541383, 429823475811, 1523511450184, 5411789548439 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

By 'binary tree' we mean a rooted, ordered tree in which each vertex has either 0 or 2 children.

LINKS

Eric S. Rowland, Pattern avoidance in binary trees.

FORMULA

Generating function f(x) satisfies -x f(x)^3 + (x-1) x f(x)^2 + (x-1)^2 f(x) + (x-1) x = 0

CROSSREFS

Sequence in context: A159773 A159769 A159771 * A128739 A036766 A148322

Adjacent sequences:  A159765 A159766 A159767 * A159769 A159770 A159771

KEYWORD

nonn

AUTHOR

Eric S Rowland (erowland(AT)math.rutgers.edu), Apr 23 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.