A138902 a(n) = d!, where d is the number of digits in n.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6, 6

Offset

0,11

Links

James Spahlinger, Table of n, a(n) for n = 0..10000

Formula

a(n) = A000142(A055642(n)). - James Spahlinger, Oct 09 2012

Prog

(Haskell) a138902 = a000142 . a055642 -- James Spahlinger, Oct 09 2012

Crossrefs

Different from A047726. Cf. A138908.

Sequence in context: A055642 A348674 A276502 * A211668 A255270 A211670

Adjacent sequences: A138899 A138900 A138901 * A138903 A138904 A138905

Keyword

easy,nonn,base

Author

Odimar Fabeny, May 16 2008

Extensions

Edited by N. J. A. Sloane, Sep 29 2011, at the suggestion of Franklin T. Adams-Watters

Status

approved