Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143396
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143396 Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels, k of which are used for root nodes and any root may contain >= 1 labels, n >= 0, 0<=k<=n. +0
2
1, 0, 1, 0, 2, 2, 0, 3, 9, 5, 0, 4, 30, 40, 15, 0, 5, 90, 220, 185, 52, 0, 6, 255, 1040, 1485, 906, 203, 0, 7, 693, 4550, 9905, 9891, 4718, 877, 0, 8, 1820, 19040, 59850, 87416, 66808, 26104, 4140, 0, 9, 4644, 77448, 341082, 686826, 750120, 463212, 153063 (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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research