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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067898 Least digit not used in n (or 10 if n is pandigital). 4
 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 COMMENTS a(A050278(1)) = a(1023456789) = 10, the first term with that value, as 1023456789 is the first base 10 pandigital number. a(A052382(n)) = 0; a(A011540(n)) > 0. [Reinhard Zumkeller, May 04 2012] LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 EXAMPLE a(10)=2 because decimal digits 0 and 1 are both used in 10, a(102)=3 because decimal digits 0, 1 and 2 are used in 102. PROG (Haskell) import Data.List (delete) a067898 n = f n [0..10] where f x ys | x <= 9 = head \$ delete x ys | otherwise = f x' \$ delete d ys where (x', d) = divMod x 10 -- Reinhard Zumkeller, May 04 2012 (Python) def A067898(n): s = set(str(n)) for i in range(10): if str(i) not in s: return i return 10 # Chai Wah Wu, Apr 13 2024 CROSSREFS Cf. A050278 (pandigital numbers). Cf. A212193 (ternary). Sequence in context: A218876 A028621 A226557 * A010106 A096159 A327166 Adjacent sequences: A067895 A067896 A067897 * A067899 A067900 A067901 KEYWORD base,easy,nonn AUTHOR Rick L. Shepherd, May 13 2003 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 12 04:07 EDT 2024. Contains 375085 sequences. (Running on oeis4.)