Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101276
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101276 Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 1. +0
1
1, 0, 1, 1, 0, 1, 1, 2, 0, 2, 2, 2, 6, 0, 4, 3, 8, 6, 16, 0, 9, 6, 14, 30, 16, 45, 0, 21, 11, 36, 54, 106, 45, 126, 0, 51, 22, 74, 168, 196, 360, 126, 357, 0, 127, 43, 173, 372, 706, 675, 1197, 357, 1016, 0, 323, 87, 378, 981, 1636, 2775, 2268, 3913, 1016, 2907, 0, 835, 176 (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 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research