cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A376376 Least number that can be written as a multinomial coefficient in exactly n ways, or 0 if no such number exists.

Original entry on oeis.org

2, 10, 6, 420, 120, 210, 4324320, 7207200, 720720, 360360, 6983776800, 9777287520, 13967553600, 48886437600, 195545750400, 24736537425600, 586637251200, 293318625600, 148419224553600, 742096122768000, 28941748787952000, 296838449107200, 1736504927277120000
Offset: 1

Views

Author

Pontus von Brömssen, Sep 23 2024

Keywords

Comments

a(n) is the least number that occurs exactly n times in A036038 or A376367, i.e., the least number m such that A376369(m) = n.
After a(62), the sequence continues (where "?" represents terms that are either 0 or greater than 10^29): ?, 92098021748598694855458432000, ?, 6268725246643132945351680000, 1567181311660783236337920000, ?, 3134362623321566472675840000. After a(69), all terms are either 0 or larger than 10^29.
It seems that a(n) often is in A025487, at least for small n. The exceptions are n = 2, 12, 26, 30, 31, 33, 34, 35, 36, 37, 38, 42, 44, ... .

Crossrefs

First column of A376370.