Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101452
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101452 Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches. +0
1
1, 2, 1, 4, 4, 4, 8, 12, 24, 11, 16, 32, 96, 88, 41, 32, 80, 320, 440, 410, 146, 64, 192, 960, 1760, 2460, 1752, 564, 128, 448, 2688, 6160, 11480, 12264, 7896, 2199, 256, 1024, 7168, 19712, 45920, 65408, 63168, 35184, 8835, 512, 2304, 18432, 59136, 165312 (list; table; graph; listen)
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research