This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A319654 #21 Sep 20 2020 14:38:06 %S A319654 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 A319654 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 A319654 53,9,45,51,57,58,59,10,46,52,58,64,65,11,47,53,59,65,71,2,8 %N A319654 Write n in 6-ary, sort digits into increasing order. %H A319654 Seiichi Manyama, <a href="/A319654/b319654.txt">Table of n, a(n) for n = 0..7775</a> %t A319654 Table[FromDigits[Sort[IntegerDigits[n,6]],6],{n,0,80}] (* _Harvey P. Dale_, Sep 20 2020 *) %o A319654 (Ruby) %o A319654 def A(k, n) %o A319654 (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)} %o A319654 end %o A319654 p A(6, 100) %o A319654 (PARI) a(n) = fromdigits(vecsort(digits(n, 6)), 6); \\ _Michel Marcus_, Sep 25 2018 %Y A319654 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 A319654 Cf. A165051, A319723. %K A319654 nonn,base,look %O A319654 0,3 %A A319654 _Seiichi Manyama_, Sep 25 2018