A392625 Parallelized coupon collector's problem: With n fair n-sided dice, a(n) = denominator(E(n)) where E(n) is the expected number of turns for n coordinating mice to have every face present.

1, 1, 8, 7, 48672, 124400, 1774217134800, 1029491058898575, 62556720388661606307200, 2061682836097056836507926992, 386206661135076679862809432480129252579200, 173506806307870079897445276652899084000, 36715574957259081430156379774655003162841821725394367760220600000

Offset

1,3

Comments

See A392624 for details.

Links

Table of n, a(n) for n=1..13.

Crossrefs

Cf. A392624 (numerators).

Sequence in context: A354546 A261117 A098432 * A390833 A392000 A197623

Adjacent sequences: A392622 A392623 A392624 * A392626 A392627 A392628

Keyword

nonn,frac

Author

Natalia L. Skirrow, Jan 17 2026

Status

approved