The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113547 Triangle read by rows: number of labeled partitions of n with maximin m. 2
 1, 1, 1, 1, 2, 2, 1, 4, 5, 5, 1, 8, 13, 15, 15, 1, 16, 35, 47, 52, 52, 1, 32, 97, 153, 188, 203, 203, 1, 64, 275, 515, 706, 825, 877, 877, 1, 128, 793, 1785, 2744, 3479, 3937, 4140, 4140, 1, 256, 2315, 6347, 11002, 15177, 18313, 20270, 21147, 21147, 1, 512, 6817, 23073, 45368, 68303, 88033, 102678, 111835, 115975, 115975 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS The maximin of a partition is the maximum over all parts of the minimum label in each part. If the rows are reversed, the result is the number of partitions of n with minimax m. The number of restricted growth functions of length n where the maximum appears first at position m. The RGF's are defined here as f(1)=1 and f(i) <=1+max_{1<=j

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

Last modified February 24 04:36 EST 2020. Contains 332197 sequences. (Running on oeis4.)