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.

A319725 Write n in 8-ary, sort digits into decreasing order.

This page as a plain text file.
%I A319725 #18 Aug 07 2024 10:35:50
%S A319725 0,1,2,3,4,5,6,7,8,9,17,25,33,41,49,57,16,17,18,26,34,42,50,58,24,25,
%T A319725 26,27,35,43,51,59,32,33,34,35,36,44,52,60,40,41,42,43,44,45,53,61,48,
%U A319725 49,50,51,52,53,54,62,56,57,58,59,60,61,62,63,64,72,136,200,264
%N A319725 Write n in 8-ary, sort digits into decreasing order.
%H A319725 Seiichi Manyama, <a href="/A319725/b319725.txt">Table of n, a(n) for n = 0..4095</a>
%F A319725 n <= a(n) < 8n. - _Charles R Greathouse IV_, Aug 07 2024
%t A319725 Table[FromDigits[ReverseSort[IntegerDigits[n, 8]], 8], {n, 0, 100}] (* _Paolo Xausa_, Aug 07 2024 *)
%o A319725 (Ruby)
%o A319725 def A(k, n)
%o A319725   (0..n).map{|i| i.to_s(k).split('').sort.reverse.join.to_i(k)}
%o A319725 end
%o A319725 p A(8, 100)
%o A319725 (PARI) a(n) = fromdigits(vecsort(digits(n, 8), , 4), 8); \\ _Michel Marcus_, Sep 26 2018
%Y A319725 b-ary: A073138 (b=2), A319651 (b=3), A319720 (b=4), A319722 (b=5), A319723 (b=6), A319724 (b=7), this sequence (b=8), A319726 (b=9), A004186 (b=10).
%Y A319725 Cf. A165090, A319656.
%K A319725 nonn,base,look,easy
%O A319725 0,3
%A A319725 _Seiichi Manyama_, Sep 26 2018