login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138902 a(n) = d!, where d is the number of digits in n. 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,11

LINKS

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

FORMULA

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

PROG

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

CROSSREFS

Different from A047726. Cf. A138908.

Sequence in context: A262190 A055642 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 21 23:28 EDT 2017. Contains 290940 sequences.