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.

A068184 Smallest number whose product of digits equals n!.

Original entry on oeis.org

1, 1, 2, 6, 38, 358, 2589, 25789, 257889, 2578879, 45578899
Offset: 0

Views

Author

Labos Elemer, Feb 18 2002

Keywords

Comments

The sequence is finite because n! for n>10 has 2-digit prime factors.

Examples

			For n=4 the solutions having digit products equal 24 excluding those with digit 1 are: {38, 46, 64, 83, 226, 234, 243, 262, 324, 342, 423, 432, 622, 2223, 2232, 2322, 3222} of which the smallest is 38. For n>1, numbers with a digit 1 are too big.
		

Crossrefs

Extensions

Edited by Henry Bottomley, Feb 26 2002