Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101372
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101372 Triangle read by rows: T(n,k) is number of leaves at level k in all noncrossing rooted trees on n+1 nodes. +0
1
1, 2, 2, 7, 10, 4, 30, 50, 32, 8, 143, 260, 208, 88, 16, 728, 1400, 1280, 704, 224, 32, 3876, 7752, 7752, 5016, 2128, 544, 64, 21318, 43890, 46816, 33880, 17248, 5984, 1280, 128, 120175, 253000, 283360, 222640, 128800, 54400, 16000, 2944, 256 (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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research