Question

Number of possibilities for n persons at m tables with at least 5 persons per table

score 216 · Answer 1 · 2017-05-28 08:48:04

216

Views

Number of possibilities for n persons at m tables with at least 5 persons per table

Published on 28 May 2017 - 8:48

score 2.2k · Answer 2 · 2017-05-30 01:56:10

2.2k

Views

Counting set partitions of $\{1,2,...,n\}$ into exactly $k$ non-empty subsets with max size $m$

Published on 30 May 2017 - 1:56

score 1.6k · Answer 3 · 2017-06-03 19:23:38

1.6k

Views

Stirling numbers of the second kind: How to obtain a recurrence relation from a generating function?

Published on 03 Jun 2017 - 19:23

score 106 · Answer 4 · 2017-06-06 20:06:11

106

Views

Limit of sum of stirling numbers computing the average image of a random function $f:[n]\to[n]$

Published on 06 Jun 2017 - 20:06

score 76 · Answer 5 · 2017-06-12 17:20:55

76

Views

How Stirling numbers of first kind add to $n!$

Published on 12 Jun 2017 - 17:20

score 213 · Answer 6 · 2017-06-15 23:45:14

213

Views

Generalised Stirling number that each partition has more than one component

Published on 15 Jun 2017 - 23:45

score 179 · Answer 7 · 2017-06-21 18:28:58

179

Views

Does $\sum_{n=1}^\infty \frac{1}{n!}{n\brace \varphi(n)}$ converge, where ${n\brace m}$ are Stirling numbers of second kind?

Published on 21 Jun 2017 - 18:28

score 971 · Answer 8 · 2017-06-22 15:11:46

971

Views

Stirling Number of the second kind recurrence combinatorial proof

Published on 22 Jun 2017 - 15:11

score 274 · Answer 9 · 2017-06-23 20:24:11

274

Views

Lower bound for Stirling numbers of the first kind

Published on 23 Jun 2017 - 20:24

score 806 · Answer 10 · 2026-03-25 22:06:27

806

Views

Compute $S_n=\sum\limits_{a_1,a_2,\cdots,a_n=1}^\infty \frac{a_1a_2\cdots a_n}{(a_1+a_2+\cdots+a_n)!}$

Published on 25 Mar 2026 - 22:06

score 4.3k · Answer 11 · 2017-07-23 00:37:55

4.3k

Views

Stirling numbers of the first kind

Published on 23 Jul 2017 - 0:37

score 292 · Answer 12 · 2017-07-23 12:15:06

292

Views

Stirling #s of 1st kind. Prove the following: $ \sum_{k=0}^n S_1(n,k)x^k = x(x +1)···(x +n−1) $

Published on 23 Jul 2017 - 12:15

score 1.3k · Answer 13 · 2026-03-28 14:56:54

1.3k

Views

The number of the partition of the set $A$ into $k$ bounded blocks.

Published on 28 Mar 2026 - 14:56

score 934 · Answer 14 · 2017-08-31 09:21:18

934

Views

How to calculate the "triangle" for stirling numbers as fast as possible?

Published on 31 Aug 2017 - 9:21

score 198 · Answer 15 · 2017-09-05 11:05:23

198

Views

Combinatorial interpretation of a sum with Stirling numbers

Published on 05 Sep 2017 - 11:05

List Question

Number of possibilities for n persons at m tables with at least 5 persons per table

Counting set partitions of $\{1,2,...,n\}$ into exactly $k$ non-empty subsets with max size $m$

Stirling numbers of the second kind: How to obtain a recurrence relation from a generating function?

Limit of sum of stirling numbers computing the average image of a random function $f:[n]\to[n]$

How Stirling numbers of first kind add to $n!$

Generalised Stirling number that each partition has more than one component

Does $\sum_{n=1}^\infty \frac{1}{n!}{n\brace \varphi(n)}$ converge, where ${n\brace m}$ are Stirling numbers of second kind?

Stirling Number of the second kind recurrence combinatorial proof

Lower bound for Stirling numbers of the first kind

Compute $S_n=\sum\limits_{a_1,a_2,\cdots,a_n=1}^\infty \frac{a_1a_2\cdots a_n}{(a_1+a_2+\cdots+a_n)!}$

Stirling numbers of the first kind

Stirling #s of 1st kind. Prove the following: $ \sum_{k=0}^n S_1(n,k)x^k = x(x +1)···(x +n−1) $

The number of the partition of the set $A$ into $k$ bounded blocks.

How to calculate the "triangle" for stirling numbers as fast as possible?

Combinatorial interpretation of a sum with Stirling numbers

Trending Questions

Popular # Hahtags

Popular Questions