Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101307
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101307 Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 2. +0
2
1, 1, 1, 3, 2, 7, 6, 1, 18, 18, 6, 47, 59, 24, 2, 129, 188, 96, 16, 362, 605, 369, 90, 4, 1038, 1948, 1395, 436, 45, 3022, 6305, 5164, 1981, 315, 9, 8917, 20460, 18885, 8568, 1830, 126, 26600, 66585, 68352, 35818, 9565, 1071, 21, 80098, 217186, 245497, 145796 (list; 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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research