id:A126688 - OEIS Search Results

Search: id:A126688

Displaying 1-1 of 1 results found.

page 1

Lowest base in which n has distinct digits.

+0
1

2, 2, 3, 4, 3, 3, 3, 4, 4, 5, 3, 4, 4, 4, 3, 5, 5, 4, 3, 5, 3, 5, 5, 4, 6, 6, 4, 4, 5, 4, 6, 6, 4, 6, 4, 4, 7, 5, 4, 5, 6, 5, 7, 4, 4, 7, 5, 5, 4, 4, 5, 4, 5, 4, 5, 4, 4, 5, 5, 6, 8, 6, 6, 9, 5, 5, 7, 6, 5, 5, 5, 7, 5, 7, 4, 5, 5, 4, 5, 5, 6, 5, 6, 5, 5, 5, 7, 7, 5, 6, 6, 8, 7, 6, 5, 5, 5, 8, 4, 11 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Start with binary and work upwards, expressing n in the given base (2,3,4... b). The term a(n)=b is the lowest base in which no two digits in n are the same.` `See A123699 for another version of the same sequence. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 15 2008`
	EXAMPLE	`75 is 1001011 in binary (base 2), 2210 in base 3 and 1023 in base 4. So a(75) = 4 since 1023 has distinct digits (and neither 1001011 nor 2210 do).`
	CROSSREFS	`Cf. A010784 (base 10), A062813 (gives lower bound for a term).` `Sequence in context: A077769 A144909 A117114 this_sequence A054703 A048206 A075765` `Adjacent sequences: A126685 A126686 A126687 this_sequence A126689 A126690 A126691`
	KEYWORD	`nonn`
	AUTHOR	`Paul Richards (pr(AT)paulrichards.me.uk), Feb 15 2007`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research