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 A319722 #17 Aug 07 2024 10:32:51 %S A319722 0,1,2,3,4,5,6,11,16,21,10,11,12,17,22,15,16,17,18,23,20,21,22,23,24, %T A319722 25,30,55,80,105,30,31,56,81,106,55,56,61,86,111,80,81,86,91,116,105, %U A319722 106,111,116,121,50,55,60,85,110,55,56,61,86,111,60,61,62,87,112,85 %N A319722 Write n in 5-ary, sort digits into decreasing order. %H A319722 Seiichi Manyama, <a href="/A319722/b319722.txt">Table of n, a(n) for n = 0..3124</a> %F A319722 n <= a(n) < 5n. - _Charles R Greathouse IV_, Aug 07 2024 %t A319722 Table[FromDigits[ReverseSort[IntegerDigits[n, 5]], 5], {n, 0, 100}] (* _Paolo Xausa_, Aug 07 2024 *) %o A319722 (Ruby) %o A319722 def A(k, n) %o A319722 (0..n).map{|i| i.to_s(k).split('').sort.reverse.join.to_i(k)} %o A319722 end %o A319722 p A(5, 100) %o A319722 (PARI) a(n) = fromdigits(vecsort(digits(n, 5), , 4), 5); \\ _Michel Marcus_, Sep 26 2018 %Y A319722 b-ary: A073138 (b=2), A319651 (b=3), A319720 (b=4), this sequence (b=5), A319723 (b=6), A319724 (b=7), A319725 (b=8), A319726 (b=9), A004186 (b=10). %Y A319722 Cf. A165032, A319653. %K A319722 nonn,base,easy %O A319722 0,3 %A A319722 _Seiichi Manyama_, Sep 26 2018