login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319656 Write n in 8-ary, sort digits into increasing order. 9

%I #16 Sep 26 2018 08:53:55

%S 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 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 30,38,46,54,55,7,15,23,31,39,47,55,63,1,9,10,11,12,13,14

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

%H Seiichi Manyama, <a href="/A319656/b319656.txt">Table of n, a(n) for n = 0..4095</a>

%o (Ruby)

%o def A(k, n)

%o (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)}

%o end

%o p A(8, 100)

%o (PARI) a(n) = fromdigits(vecsort(digits(n, 8)), 8); \\ _Michel Marcus_, Sep 25 2018

%Y 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 Cf. A165090.

%K nonn,base,look

%O 0,3

%A _Seiichi Manyama_, Sep 25 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 04:05 EDT 2024. Contains 371235 sequences. (Running on oeis4.)