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.

A319655 Write n in 7-ary, sort digits into increasing order.

This page as a plain text file.
%I A319655 #23 Aug 07 2024 15:43:23
%S A319655 0,1,2,3,4,5,6,1,8,9,10,11,12,13,2,9,16,17,18,19,20,3,10,17,24,25,26,
%T A319655 27,4,11,18,25,32,33,34,5,12,19,26,33,40,41,6,13,20,27,34,41,48,1,8,9,
%U A319655 10,11,12,13,8,57,58,59,60,61,62,9,58,65,66,67,68,69,10,59,66,73
%N A319655 Write n in 7-ary, sort digits into increasing order.
%H A319655 Seiichi Manyama, <a href="/A319655/b319655.txt">Table of n, a(n) for n = 0..2400</a>
%p A319655 a:= n-> (l-> add(l[-i]*7^(i-1), i=1..nops(l)))(sort(convert(n, base, 7))):
%p A319655 seq(a(n), n=0..73);  # _Alois P. Heinz_, Aug 07 2024
%t A319655 Table[FromDigits[Sort[IntegerDigits[n, 7]], 7], {n, 0, 100}] (* _Paolo Xausa_, Aug 07 2024 *)
%o A319655 (Ruby)
%o A319655 def A(k, n)
%o A319655   (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)}
%o A319655 end
%o A319655 p A(7, 100)
%o A319655 (PARI) a(n) = fromdigits(vecsort(digits(n, 7)), 7); \\ _Michel Marcus_, Sep 25 2018
%Y A319655 b-ary: A038573 (b=2), A038574 (b=3), A319652 (b=4), A319653 (b=5), A319654 (b=6), this sequence (b=7), A319656 (b=8), A319657 (b=9), A004185 (b=10).
%Y A319655 Cf. A165071, A319724.
%K A319655 nonn,base,look
%O A319655 0,3
%A A319655 _Seiichi Manyama_, Sep 25 2018