login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211351 Refined triangle A091867: T(n,k) is the number of noncrossing partitions of an n-set that are of type k (k-th integer partition, defined by A194602). 2
1, 1, 1, 1, 3, 1, 1, 6, 4, 2, 1, 1, 10, 10, 10, 5, 5, 1, 1, 15, 20, 30, 15, 30, 6, 5, 6, 3, 1, 1, 21, 35, 70, 35, 105, 21, 35, 42, 21, 7, 21, 7, 7, 1, 1, 28, 56, 140, 70, 280, 56, 140, 168, 84, 28, 168, 56, 56, 8, 14, 28, 28, 8, 8, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
The rows are counted from 1, the columns from 0.
Row lengths: 1,2,3,5,7,11... (partition numbers A000041)
Row sums: 1,2,5,14,42,132... (Catalan numbers A000108)
Row maxima: 1,1,3,6,10,30,105,280,756,2520,6930,18480 (A130760)
Distinct entries per row: 1,1,2,4,3,7,7,11,12,18,18,30
Rightmost columns are those from Pascal's triangle A007318 without the second one (i.e. triangle A184049). The other columns - (always?) without a 1 at the top - are multiples of these columns from Pascal's triangle; so actually only the top elements of each column are needed to calculate the other entries; these top elements are in A211361.
LINKS
CROSSREFS
Sequence in context: A305059 A355996 A128101 * A124802 A211350 A178867
KEYWORD
tabf,nonn
AUTHOR
Tilman Piesk, Apr 09 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)