The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095049 Number of distinct digits needed to write in decimal representation all positive non-divisors of n that are less than n. 1
 0, 0, 1, 1, 3, 2, 5, 4, 6, 6, 10, 6, 10, 9, 9, 9, 10, 9, 10, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS a(n) = 10 for n > 20. LINKS EXAMPLE Set of non-divisors of n=12: {5,7,8,9,10,11}, therefore a(12)=#{0,1,5,7,8,9}=6. MATHEMATICA Table[Length[Union[Flatten[IntegerDigits/@Complement[Range[n], Divisors[ n]]]]], {n, 80}] (* Harvey P. Dale, Jan 06 2019 *) CROSSREFS Cf. A095048, A043537. Sequence in context: A089279 A049820 A109712 * A118209 A109451 A160017 Adjacent sequences:  A095046 A095047 A095048 * A095050 A095051 A095052 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, May 28 2004 STATUS approved

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.

Last modified September 27 00:14 EDT 2020. Contains 337378 sequences. (Running on oeis4.)