|
Search: id:A061901
|
|
|
| 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, 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; listen)
|
|
|
OFFSET
|
0,11
|
|
|
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: A110550 A128220 A134749 this_sequence A078822 A069745 A112199
Adjacent sequences: A061898 A061899 A061900 this_sequence A061902 A061903 A061904
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Asher Auel (asher.auel(AT)reed.edu), May 05 2001
|
|
|
Search completed in 0.002 seconds
|
