Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122085
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122085 Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= n-1, except k=0 or 1 if n=1, k=1 if n=2) nodes of one color and n-k nodes of the other color (the colors are not interchangeable). +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 4, 2, 1, 1, 3, 7, 7, 3, 1, 1, 3, 10, 14, 10, 3, 1, 1, 4, 14, 28, 28, 14, 4, 1, 1, 4, 19, 45, 65, 45, 19, 4, 1, 1, 5, 24, 73, 132, 132, 73, 24, 5, 1, 1, 5, 30, 105, 242, 316, 242, 105, 30, 5, 1, 1, 6, 37, 152, 412, 693, 693, 412, 152 (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 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research