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!)
A158900 O.g.f.:G(G(x)-1)where G(x)=Sum_k>=0,k!*x^k 0
1, 1, 4, 20, 116, 756, 5448, 43032, 370704, 3472656, 35303424, 388786176, 4628774016, 59431077504, 820503839232, 12140411779584, 191844739736064, 3226219598338560, 57540789020021760, 1084906603389864960 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(n) is the number of ways to create(select) each Ferrers "type" diagram of the ORDERED partitions (compositions), then label (linearly order) the cells within each row of the diagram, and then linearly order each row.
LINKS
EXAMPLE
a(3)=20 because each composition of three: 3,2+1,1+2,1+1+1 can be so ordered in 3!+2!*2!+2!*2!+3!=20 ways respectively.
MATHEMATICA
A[x_] = Sum[i! x^i, {i, 1, 20}] B[x_] = Sum[i! x^i, {i, 0, 20}] CoefficientList[Expand[Composition[B, A][x]], x]
CROSSREFS
Sequence in context: A082298 A129378 A078944 * A190194 A370530 A127088
KEYWORD
nonn
AUTHOR
Geoffrey Critzer, Mar 29 2009
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 August 27 15:26 EDT 2024. Contains 375470 sequences. (Running on oeis4.)