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.

A069468 Number of ways writing n! as a product of some other numbers which has no digits equal to 1.

Original entry on oeis.org

0, 1, 3, 17, 68, 807, 5310, 121536, 2775630, 48782385, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Labos Elemer, Mar 25 2002

Keywords

Examples

			n=4, 4!=24, A067734(24)=17 and the 17 solutions are as follows: {38,46,64,83,226,234,243,262,324,342,423,432,622,2223,2232,2322,3222}.
		

Crossrefs

Formula

a(n) = A067734(n!) = A067734(A000142(n)).
a(n) = 0 if n>10 since A068184 and A067185 are complete sequences.

Extensions

More terms from Max Alekseyev, Sep 19 2009