OFFSET
1,3
COMMENTS
Number of n-tuples containing all elements of [m] with a unique last element.
Consider an urn with m balls of pairwise different colors. T(n,m) is motivated by the probability p(n,m) for exactly n draws with replacement needed to obtain all colors; p(n,m)=T(n,m)/m^n. - With m fixed and n running, p(n,m) is a probability distribution. The expected number of draws needed to obtain all colors is Sum_{j=1..m} m/j. (Expected value provided by M. Shackleford.)
LINKS
Michael Shackleford, Problem 74. Free gift in the cereal box problem #2, Mathproblems.info.
FORMULA
EXAMPLE
The triangle T(n,m) begins:
n\m 1 2 3 4 5 6 7 8 9 10 ...
1: 1
2: 0 2
3: 0 2 6
4: 0 2 18 24
5: 0 2 42 144 120
6: 0 2 90 600 1200 720
7: 0 2 186 2160 7800 10800 5040
8: 0 2 378 7224 42000 100800 105840 40320
9: 0 2 762 23184 204120 756000 1340640 1128960 362880
10: 0 2 1530 72600 932400 5004720 13335840 18627840 13063680 3628800
...
T(4,3)=18 is the number of 4-sequences of draws from [3] completing the covering of [3] with the last draw; these sequences are (without brackets and commas):
1123 1213 1223 2113 2123 2213 1132 1312 1332
3112 3132 3312 2231 2321 2331 3221 3231 3321
MATHEMATICA
Table[m! StirlingS2[n - 1, m - 1], {n, 10}, {m, n}]//Flatten
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Manfred Boergens, Feb 10 2025
STATUS
approved