%I A126688
%S A126688 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,
%T A126688 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,
%U A126688 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
%N A126688 Lowest base in which n has distinct digits.
%C A126688 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.
%C A126688 See A123699 for another version of the same sequence. - R. J. Mathar 
               (mathar(AT)strw.leidenuniv.nl), Jun 15 2008
%e A126688 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).
%Y A126688 Cf. A010784 (base 10), A062813 (gives lower bound for a term).
%Y A126688 Sequence in context: A077769 A144909 A117114 this_sequence A054703 A048206 
               A075765
%Y A126688 Adjacent sequences: A126685 A126686 A126687 this_sequence A126689 A126690 
               A126691
%K A126688 nonn
%O A126688 1,1
%A A126688 Paul Richards (pr(AT)paulrichards.me.uk), Feb 15 2007