A137564 - OEIS

This site is supported by donations to The OEIS Foundation.

A137564

The number formed by removing from n all duplicate digits except the leftmost copy of each.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 2, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 3, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 4, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 5, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 6, 67, 68, 69, 70, 71, 72, 73, 74 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	COMMENTS	`a(n)=n iff n is a term of A010784. a(n)<n iff n is a term of A109303.`
	EXAMPLE	`a(100)=10 as a (second) 0 digit is dropped. a(100) is the first term differing from A106612's terms: A106612(100)=100. a(1211323171)=1237.`
	CROSSREFS	`Cf. A106612, A010784, A109303.` `Sequence in context: A118541 A084905 A180409 * A106612 A056960 A103693` `Adjacent sequences: A137561 A137562 A137563 * A137565 A137566 A137567`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jan 25 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:47 EST 2012. Contains 205623 sequences.