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!)
 A057303 Numbers n such that the number of distinct digits in n is a digit of n. 0
 1, 11, 12, 20, 21, 23, 24, 25, 26, 27, 28, 29, 32, 42, 52, 62, 72, 82, 92, 103, 111, 112, 121, 122, 123, 130, 132, 134, 135, 136, 137, 138, 139, 143, 153, 163, 173, 183, 193, 200, 202, 203, 211, 212, 213, 220, 221, 223, 224, 225, 226, 227, 228, 229, 230, 231 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The repunits (A000042) are a subsequence. Analogous in construction to the refactorable numbers (A033950). REFERENCES S. Colton, Unpublished PhD Thesis, University of Edinburgh, 2000. LINKS S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999, #2. EXAMPLE 103 has 3 distinct digits in base 10 and 3 is a base 10 digit of 103. PROG (PARI) isok(n) = {my(d = vecsort(digits(n), , 8)); vecsearch(d, #d); } \\ Michel Marcus, Feb 23 2016 CROSSREFS Cf. A000042. Sequence in context: A134926 A105744 A092096 * A121979 A109372 A066686 Adjacent sequences:  A057300 A057301 A057302 * A057304 A057305 A057306 KEYWORD nonn,base AUTHOR Simon Colton (simonco(AT)cs.york.ac.uk), Aug 25 2000 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 26 06:16 EDT 2021. Contains 347664 sequences. (Running on oeis4.)