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

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,3

Links

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

Formula

a(n) = A067734(n!) = A067734(A000142(n)).

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

Example

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

Cf. A067734, A000142, A068183, A068185.

Sequence in context: A101562 A034566 A357923 * A241776 A270231 A265919

Adjacent sequences: A069465 A069466 A069467 * A069469 A069470 A069471

Keyword

base,nonn

Author

Labos Elemer, Mar 25 2002

Extensions

More terms from Max Alekseyev, Sep 19 2009

Status

approved