Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #17 Aug 09 2017 00:42:33
%S 0,1,2,3,4,5,7,8,9,10,11,13,14,15,16,17,19,20,21,22,23,27,28,29,35,38,
%T 39,40,42,44,45,47,48,51,53,54,55,58,59,65,66,69,70,71,73,76,77,79,80,
%U 82,84,85,86,89,95,96,97,101,102,103,105,107,108,110,111,113
%N Xenodromes: all digits in base 5 are different.
%H Nathaniel Johnston, <a href="/A023800/b023800.txt">Table of n, a(n) for n = 1..261</a> (full sequence)
%p A023800 := proc(n) option remember: local d,j,k,inseq: if(n=1)then return 0:fi: for k from procname(n-1)+1 do d:=convert(k,base,5): inseq:=true: for j from 0 to 4 do if(numboccur(d,j)>=2)then inseq:=false:break: fi: od: if(inseq)then return k: fi: od: end: seq(A023800(n),n=1..66); # _Nathaniel Johnston_, May 17 2011
%t Select[Range[0, 3000], Length[b5 = IntegerDigits[#, 5]] == Length[Union[b5]]&] (* _Jean-François Alcover_, Feb 13 2014 *)
%t Select[Range[0,120],Max[DigitCount[#,5]]==1&] (* _Harvey P. Dale_, Sep 22 2016 *)
%Y Cf. A023798 - A023810.
%K nonn,base,fini,full,easy
%O 1,3
%A _Olivier Gérard_