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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A043537 Number of distinct base 10 digits of n. 46

%I

%S 1,1,1,1,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,1,2,

%T 2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,1,2,2,

%U 2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,1,2,2

%N Number of distinct base 10 digits of n.

%C a(A000079(A130694(n))) = 10. - _Reinhard Zumkeller_, Jul 29 2007

%C a(A000290(A016070(n))) = 2. - _Reinhard Zumkeller_, Aug 05 2010

%C a(n) = 10 for almost all n. - _Charles R Greathouse IV_, Oct 02 2013

%H R. Zumkeller, <a href="/A043537/b043537.txt">Table of n, a(n) for n = 1..10000</a>

%p A043537 := proc(n)

%p convert(convert(n,base,10),set) ;

%p nops(%) ;

%p end proc: # _R. J. Mathar_, Dec 22 2012

%t Count[DigitCount@ #, n_ /; n > 0] & /@ Range@ 120 (* _Michael De Vlieger_, Aug 29 2015 *)

%o (Haskell)

%o import Data.List (nub)

%o a043537 = length . nub . show -- _Reinhard Zumkeller_, Apr 16 2011

%o (PARI) a(n)=#vecsort(digits(n),,8) \\ _Charles R Greathouse IV_, Oct 02 2013

%Y Cf. A047726, A118668, A119797, A119798, A119799, A119823, A038378, A076493, A055642, A178788.

%K nonn,base,easy

%O 1,10

%A _Clark Kimberling_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 12:09 EST 2019. Contains 320310 sequences. (Running on oeis4.)