Description Usage Arguments Value Author(s) References Examples

Denote the number of ways to partition a set of n objects into k non-empty subsets

1 | ```
stirling2(n, k)
``` |

`n` |
(integer): the number of the objects |

`k` |
(integer <=n): the number of the non-empty subsets (buckets) |

a "list" containing the following components:

S | the stirling number of the second kind | |

SM | a matrix showing, for each k (on the columns) in how many ways the n objects (on the rows) can be partitioned |

Antonio D'Ambrosio antdambr@unina.it

Comtet, L. (1974). Advanced Combinatorics: The art of finite and infinite expansions. D. Reidel, Dordrecth, The Netherlands.

1 | ```
parts<-stirling2(4,2)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.