|
|
A319726
|
|
Write n in 9-ary, sort digits into decreasing order.
|
|
8
|
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 19, 28, 37, 46, 55, 64, 73, 18, 19, 20, 29, 38, 47, 56, 65, 74, 27, 28, 29, 30, 39, 48, 57, 66, 75, 36, 37, 38, 39, 40, 49, 58, 67, 76, 45, 46, 47, 48, 49, 50, 59, 68, 77, 54, 55, 56, 57, 58, 59, 60, 69, 78, 63, 64, 65, 66, 67, 68, 69
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
MATHEMATICA
|
Table[FromDigits[Reverse[Sort[IntegerDigits[n, 9]]], 9], {n, 0, 70}] (* Harvey P. Dale, Oct 26 2022 *)
|
|
PROG
|
(Ruby)
def A(k, n)
(0..n).map{|i| i.to_s(k).split('').sort.reverse.join.to_i(k)}
end
p A(9, 100)
(PARI) a(n) = fromdigits(vecsort(digits(n, 9), , 4), 9); \\ Michel Marcus, Sep 26 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|