cp's OEIS Frontend

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.

A319656 Write n in 8-ary, sort digits into increasing order.

This page as a plain text file.
%I A319656 #20 Aug 07 2024 15:49:16
%S A319656 0,1,2,3,4,5,6,7,1,9,10,11,12,13,14,15,2,10,18,19,20,21,22,23,3,11,19,
%T A319656 27,28,29,30,31,4,12,20,28,36,37,38,39,5,13,21,29,37,45,46,47,6,14,22,
%U A319656 30,38,46,54,55,7,15,23,31,39,47,55,63,1,9,10,11,12,13,14
%N A319656 Write n in 8-ary, sort digits into increasing order.
%H A319656 Seiichi Manyama, <a href="/A319656/b319656.txt">Table of n, a(n) for n = 0..4095</a>
%p A319656 a:= n-> (l-> add(l[-i]*8^(i-1), i=1..nops(l)))(sort(convert(n, base, 8))):
%p A319656 seq(a(n), n=0..70);  # _Alois P. Heinz_, Aug 07 2024
%t A319656 Table[FromDigits[Sort[IntegerDigits[n, 8]], 8], {n, 0, 100}] (* _Paolo Xausa_, Aug 07 2024 *)
%o A319656 (Ruby)
%o A319656 def A(k, n)
%o A319656   (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)}
%o A319656 end
%o A319656 p A(8, 100)
%o A319656 (PARI) a(n) = fromdigits(vecsort(digits(n, 8)), 8); \\ _Michel Marcus_, Sep 25 2018
%Y A319656 b-ary: A038573 (b=2), A038574 (b=3), A319652 (b=4), A319653 (b=5), A319654 (b=6), A319655 (b=7), this sequence (b=8), A319657 (b=9), A004185 (b=10).
%Y A319656 Cf. A165090.
%K A319656 nonn,base,look
%O A319656 0,3
%A A319656 _Seiichi Manyama_, Sep 25 2018