[go: up one dir, main page]

login
A043537
Number of distinct base-10 digits of n.
58
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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2
OFFSET
1,10
COMMENTS
a(A000079(A130694(n))) = 10. - Reinhard Zumkeller, Jul 29 2007
a(A000290(A016070(n))) = 2. - Reinhard Zumkeller, Aug 05 2010
a(n) = 10 for almost all n. - Charles R Greathouse IV, Oct 02 2013
LINKS
MAPLE
A043537 := proc(n)
convert(convert(n, base, 10), set) ;
nops(%) ;
end proc: # R. J. Mathar, Dec 22 2012
MATHEMATICA
Count[DigitCount@ #, n_ /; n > 0] & /@ Range@ 120 (* Michael De Vlieger, Aug 29 2015 *)
PROG
(Haskell)
import Data.List (nub)
a043537 = length . nub . show -- Reinhard Zumkeller, Apr 16 2011
(PARI) a(n)=#vecsort(digits(n), , 8) \\ Charles R Greathouse IV, Oct 02 2013
(Python)
def A043537(n): return len(set(str(n))) # Dimiter Skordev, Oct 02 2021
KEYWORD
nonn,base,easy
STATUS
approved