Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159768 Number of n-leaf binary trees that do not contain (()(()(()((()())())))) as a subtree. +0
2
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; 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 + (x-1) x f(x)^2 + (x-1)^2 f(x) + (x-1) x = 0

CROSSREFS

Sequence in context: A159773 A159769 A159771 this_sequence A128739 A036766 A148322

Adjacent sequences: A159765 A159766 A159767 this_sequence A159769 A159770 A159771

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research