id:A095048 - OEIS Search Results

Search: id:A095048

Displaying 1-1 of 1 results found.

page 1

Number of distinct digits needed to write all positive divisors of n in decimal representation.

+0
3

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; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) <= 10, a(A095050(n)) = 10.`
	EXAMPLE	`Set of divisors of n=10: {1,2,5,10}, therefore` `a(10)=#{0,1,2,5}=4.`
	CROSSREFS	`Cf. A095049, A043537.` `Sequence in context: A076888 A087990 A138707 this_sequence A084302 A080256 A035149` `Adjacent sequences: A095045 A095046 A095047 this_sequence A095049 A095050 A095051`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 28 2004`

page 1

Search completed in 0.002 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research