|
| |
|
|
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 A322348 A321232
Adjacent sequences: A061898 A061899 A061900 * A061902 A061903 A061904
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
Asher Auel (asher.auel(AT)reed.edu), May 05 2001
|
|
|
STATUS
|
approved
|
| |
|
|
