A319725 Write n in 8-ary, sort digits into decreasing order.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 17, 25, 33, 41, 49, 57, 16, 17, 18, 26, 34, 42, 50, 58, 24, 25, 26, 27, 35, 43, 51, 59, 32, 33, 34, 35, 36, 44, 52, 60, 40, 41, 42, 43, 44, 45, 53, 61, 48, 49, 50, 51, 52, 53, 54, 62, 56, 57, 58, 59, 60, 61, 62, 63, 64, 72, 136, 200, 264
Offset: 0
Links
- Seiichi Manyama, Table of n, a(n) for n = 0..4095
Crossrefs
Programs
-
Mathematica
Table[FromDigits[ReverseSort[IntegerDigits[n, 8]], 8], {n, 0, 100}] (* Paolo Xausa, Aug 07 2024 *)
-
PARI
a(n) = fromdigits(vecsort(digits(n, 8), , 4), 8); \\ Michel Marcus, Sep 26 2018
-
Ruby
def A(k, n) (0..n).map{|i| i.to_s(k).split('').sort.reverse.join.to_i(k)} end p A(8, 100)
Formula
n <= a(n) < 8n. - Charles R Greathouse IV, Aug 07 2024