Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Sep 27 2023 14:34:55
%S 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,
%T 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,
%U 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
%N a(n) = d!, where d is the number of digits in n.
%H James Spahlinger, <a href="/A138902/b138902.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = A000142(A055642(n)). - _James Spahlinger_, Oct 09 2012
%o (Haskell) a138902 = a000142 . a055642 -- _James Spahlinger_, Oct 09 2012
%Y Different from A047726. Cf. A138908.
%K easy,nonn,base
%O 0,11
%A _Odimar Fabeny_, May 16 2008
%E Edited by _N. J. A. Sloane_, Sep 29 2011, at the suggestion of _Franklin T. Adams-Watters_