Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159770
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159770 Number of n-leaf binary trees that do not contain (()(()(((()())())()))) as a subtree. +0
2
1, 1, 2, 5, 14, 41, 124, 384, 1211, 3875, 12548, 41040, 135370, 449791, 1504057, 5057668, 17092030, 58018150, 197727023, 676290905, 2320721255, 7987481185, 27566740439, 95379299734, 330774138321, 1149589209136, 4003322875481 (list; graph; listen)
OFFSET

1,3

COMMENT

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 + (-2 x^2 + 3 x - 1) f(x)^2 + x (x^2 - 3 x + 1) f(x) + x^3 = 0

CROSSREFS

Sequence in context: A108626 A159772 A161898 this_sequence A159773 A159769 A159771

Adjacent sequences: A159767 A159768 A159769 this_sequence A159771 A159772 A159773

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.005 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research