The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A043537 Number of distinct base-10 digits of n. 56
 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 (list; graph; refs; listen; history; text; internal format)
 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 R. Zumkeller, Table of n, a(n) for n = 1..10000 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 CROSSREFS Cf. A047726, A118668, A119797, A119798, A119799, A119823, A038378, A076493, A055642, A178788. Sequence in context: A043561 A297778 A043562 * A047726 A297779 A043563 Adjacent sequences:  A043534 A043535 A043536 * A043538 A043539 A043540 KEYWORD nonn,base,easy AUTHOR STATUS approved

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

Last modified August 10 04:27 EDT 2022. Contains 356029 sequences. (Running on oeis4.)