This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319652 Write n in 4-ary, sort digits into increasing order. 9
 0, 1, 2, 3, 1, 5, 6, 7, 2, 6, 10, 11, 3, 7, 11, 15, 1, 5, 6, 7, 5, 21, 22, 23, 6, 22, 26, 27, 7, 23, 27, 31, 2, 6, 10, 11, 6, 22, 26, 27, 10, 26, 42, 43, 11, 27, 43, 47, 3, 7, 11, 15, 7, 23, 27, 31, 11, 27, 43, 47, 15, 31, 47, 63, 1, 5, 6, 7, 5, 21, 22, 23, 6, 22, 26, 27 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..4095 PROG (Ruby) def A(k, n)   (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)} end p A(4, 100) (PARI) a(n) = fromdigits(vecsort(digits(n, 4)), 4); \\ Michel Marcus, Sep 25 2018 CROSSREFS b-ary: A038573 (b=2), A038574 (b=3), this sequence (b=4), A319653 (b=5), A319654 (b=6), A319655 (b=7), A319656 (b=8), A319657 (b=9), A004185 (b=10). Cf. A165012. Sequence in context: A072400 A007913 A083346 * A327938 A065883 A214392 Adjacent sequences:  A319649 A319650 A319651 * A319653 A319654 A319655 KEYWORD nonn,base AUTHOR Seiichi Manyama, Sep 25 2018 STATUS approved

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

Last modified October 16 13:51 EDT 2019. Contains 328093 sequences. (Running on oeis4.)