Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101449
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101449 Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot nodes of degree 1. +0
2
1, 1, 2, 4, 4, 4, 11, 24, 12, 8, 41, 88, 96, 32, 16, 146, 410, 440, 320, 80, 32, 564, 1752, 2460, 1760, 960, 192, 64, 2199, 7896, 12264, 11480, 6160, 2688, 448, 128, 8835, 35184, 63168, 65408, 45920, 19712, 7168, 1024, 256, 35989, 159030, 316656, 379008 (list; table; graph; listen)
page 1

Search completed in 0.001 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research