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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319657 Write n in 9-ary, sort digits into increasing order. 9
 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 10, 11, 12, 13, 14, 15, 16, 17, 2, 11, 20, 21, 22, 23, 24, 25, 26, 3, 12, 21, 30, 31, 32, 33, 34, 35, 4, 13, 22, 31, 40, 41, 42, 43, 44, 5, 14, 23, 32, 41, 50, 51, 52, 53, 6, 15, 24, 33, 42, 51, 60, 61, 62, 7, 16, 25, 34, 43, 52, 61, 70, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..6560 PROG (Ruby) def A(k, n)   (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)} end p A(9, 100) (PARI) a(n) = fromdigits(vecsort(digits(n, 9)), 9); \\ Michel Marcus, Sep 25 2018 CROSSREFS b-ary: A038573 (b=2), A038574 (b=3), A319652 (b=4), A319653 (b=5), A319654 (b=6), A319655 (b=7), A319656 (b=8), this sequence (b=9), A004185 (b=10). Cf. A165110. Sequence in context: A033929 A025482 A023125 * A255594 A030108 A307651 Adjacent sequences:  A319654 A319655 A319656 * A319658 A319659 A319660 KEYWORD nonn,base,look 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 January 20 10:18 EST 2022. Contains 350471 sequences. (Running on oeis4.)