|
%I #18 May 04 2015 01:18:07
%S 1,1,1,1,2,3,3,3,4,5,5,6,6,5,6,7,5,9,8,8,9,7,7,10,9,8,9,10,8,9,9,10,9,
%T 10,10,10,10,10,9,10,10,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%U 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N Number of distinct digits in decimal representation of n!.
%H Reinhard Zumkeller, <a href="/A137580/b137580.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.
%F a(n) = A043537(A000142(n)).
%F a(n) < 10 iff A137579(n) = 0.
%F a(A182049(n)) < 10. - _Reinhard Zumkeller_, Apr 08 2012
%e n=12: 12! = 479001600 => a(12) = #{0,1,4,6,7,9} = 6.
%t Map[Length[Union[IntegerDigits[#]]] &, Table[n!, {n, 0, 79}]] (* _Geoffrey Critzer_, May 25 2013 *)
%o (Haskell)
%o import Data.List (nub, sort)
%o a137580 = length . nub . show . a000142
%o -- _Reinhard Zumkeller_, Apr 08 2012
%o (PARI) A137580(n)=#Set(digits(n!)) \\ _M. F. Hasler_, May 04 2015
%Y Cf. A137577, A137578.
%Y Cf. A034886.
%K nonn,base
%O 0,5
%A _Reinhard Zumkeller_, Jan 27 2008
|
