%I #21 Sep 20 2020 14:38:06

%S 0,1,2,3,4,5,1,7,8,9,10,11,2,8,14,15,16,17,3,9,15,21,22,23,4,10,16,22,

%T 28,29,5,11,17,23,29,35,1,7,8,9,10,11,7,43,44,45,46,47,8,44,50,51,52,

%U 53,9,45,51,57,58,59,10,46,52,58,64,65,11,47,53,59,65,71,2,8

%N Write n in 6-ary, sort digits into increasing order.

%H Seiichi Manyama, <a href="/A319654/b319654.txt">Table of n, a(n) for n = 0..7775</a>

%t Table[FromDigits[Sort[IntegerDigits[n,6]],6],{n,0,80}] (* _Harvey P. Dale_, Sep 20 2020 *)

%o (Ruby)

%o def A(k, n)

%o (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)}

%o end

%o p A(6, 100)

%o (PARI) a(n) = fromdigits(vecsort(digits(n, 6)), 6); \\ _Michel Marcus_, Sep 25 2018

%Y b-ary: A038573 (b=2), A038574 (b=3), A319652 (b=4), A319653 (b=5), this sequence (b=6), A319655 (b=7), A319656 (b=8), A319657 (b=9), A004185 (b=10).

%Y Cf. A165051, A319723.

%K nonn,base,look

%O 0,3

%A _Seiichi Manyama_, Sep 25 2018