|
|
A319654
|
|
Write n in 6-ary, sort digits into increasing order.
|
|
9
|
|
|
0, 1, 2, 3, 4, 5, 1, 7, 8, 9, 10, 11, 2, 8, 14, 15, 16, 17, 3, 9, 15, 21, 22, 23, 4, 10, 16, 22, 28, 29, 5, 11, 17, 23, 29, 35, 1, 7, 8, 9, 10, 11, 7, 43, 44, 45, 46, 47, 8, 44, 50, 51, 52, 53, 9, 45, 51, 57, 58, 59, 10, 46, 52, 58, 64, 65, 11, 47, 53, 59, 65, 71, 2, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
MATHEMATICA
|
Table[FromDigits[Sort[IntegerDigits[n, 6]], 6], {n, 0, 80}] (* Harvey P. Dale, Sep 20 2020 *)
|
|
PROG
|
(Ruby)
def A(k, n)
(0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)}
end
p A(6, 100)
(PARI) a(n) = fromdigits(vecsort(digits(n, 6)), 6); \\ Michel Marcus, Sep 25 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|