id:A118668 - OEIS Search Results

Search: id:A118668

Displaying 1-1 of 1 results found.

page 1

Number of distinct digits needed to write the n-th triangular number in decimal representation.

+0
2

1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 1, 3, 3, 3, 3, 3, 3, 3, 2, 4, 3, 3, 3, 3, 4, 4, 4, 3, 4, 4, 4, 4, 2, 3, 4, 3, 4, 4, 3, 4, 2, 3, 4, 4, 4, 3, 3, 4, 3, 4, 3, 2, 4, 4, 4, 3, 3, 4, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 3, 4, 4, 4, 2, 2, 3, 3, 4 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`0 < a(n) <= 10;` `a(n) = A043537(A000217(n)).`
	EXAMPLE	`n=99: 99(99+1)/2 = 4950 -> a(99) = #{0,4,5,9} = 4;` `see A119033 for an overview of sequences with terms composed of not more than 3 distinct digits.` `n=100: 100(100+1)/2 = 5050 -> a(100) = #{0,5} = 2;`
	CROSSREFS	`Sequence in context: A085297 A080972 A037814 this_sequence A044925 A027386 A102671` `Adjacent sequences: A118665 A118666 A118667 this_sequence A118669 A118670 A118671`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 19 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research