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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061901 Number of distinct numbers that can be formed from the digits of n. 0
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 2, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 2, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 2, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 2, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 2, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 6, 11, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 LINKS Table of n, a(n) for n=0..103. EXAMPLE The digits of 13 can form 1, 3, 13 and 31. The digits of 201 can form 0, 1, 2, 10, 12, 20, 21, 102, 120, 210 and 201. Thus a(13) = 4, a(201) = 11. CROSSREFS Cf. A061487, A061497, A061499, A061500. Sequence in context: A258242 A287869 A134749 * A322349 A321232 A326015 Adjacent sequences: A061898 A061899 A061900 * A061902 A061903 A061904 KEYWORD nonn,base AUTHOR Asher Auel, May 05 2001 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 December 2 09:50 EST 2023. Contains 367517 sequences. (Running on oeis4.)