OFFSET
1,3
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..261 (full sequence)
MAPLE
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
MATHEMATICA
Select[Range[0, 3000], Length[b5 = IntegerDigits[#, 5]] == Length[Union[b5]]&] (* Jean-François Alcover, Feb 13 2014 *)
Select[Range[0, 120], Max[DigitCount[#, 5]]==1&] (* Harvey P. Dale, Sep 22 2016 *)
CROSSREFS
KEYWORD
nonn,base,fini,full,easy
AUTHOR
STATUS
approved