|
|
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
|
|
|
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
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|