A360590 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A360590

a(n) is the smallest number which can be represented as the product of n distinct integers > 1 in exactly n ways.

2, 12, 60, 420, 3456, 60060, 155520, 1512000, 13063680, 169344000, 1524096000, 16765056000, 217945728000, 3705077376000, 52306974720000, 889218570240000, 16895152834560000, 328655183560704000, 6244448487653376000, 143622315216027648000, 2922401892221779968000, 67215243521100939264000

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

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

Eric Weisstein's World of Mathematics, Unordered Factorization

EXAMPLE

For n = 2: 12 = 2 * 6 = 3 * 4.

For n = 3: 60 = 2 * 3 * 10 = 2 * 5 * 6 = 3 * 4 * 5.

For n = 4: 420 = 2 * 3 * 5 * 14 = 2 * 3 * 7 * 10 = 2 * 5 * 6 * 7 = 3 * 4 * 5 * 7.

CROSSREFS

Cf. A045778, A330974.