|
| |
|
|
A095048
|
|
Number of distinct digits needed to write all positive divisors of n in decimal representation.
|
|
5
| |
|
|
1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 1, 5, 2, 4, 3, 5, 2, 6, 2, 5, 4, 2, 3, 6, 3, 4, 5, 5, 3, 6, 2, 6, 2, 5, 4, 7, 3, 5, 3, 6, 2, 6, 3, 3, 5, 5, 3, 6, 4, 4, 4, 6, 3, 9, 2, 7, 5, 5, 3, 7, 2, 4, 6, 6, 4, 4, 3, 7, 5, 7, 2, 8, 3, 5, 5, 8, 2, 7, 3, 7, 6, 4, 3, 7, 4, 6, 6, 4, 3, 9, 4, 6, 3, 5, 3, 7, 3, 6, 3, 5, 2, 8
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(n) <= 10, a(A095050(n)) = 10.
a(A206159(n)) <= 2. [Reinhard Zumkeller, Feb 05 2012]
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
| Set of divisors of n=10: {1,2,5,10}, therefore
a(10)=#{0,1,2,5}=4.
|
|
|
PROG
| (Haskell)
import Data.List (group, sort)
a095048 = length . group . sort . concatMap show . a027750_row
-- Reinhard Zumkeller, Feb 05 2012
|
|
|
CROSSREFS
| Cf. A095049, A095050, A043537.
Cf. A027750, A059436.
Sequence in context: A087990 A179940 A138707 * A084302 A080256 A035149
Adjacent sequences: A095045 A095046 A095047 * A095049 A095050 A095051
|
|
|
KEYWORD
| nonn,base,changed
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 28 2004
|
| |
|
|
