A263328 Permutation of {0, ..., 1023} corresponding to lexicographic ordering of numbers with decreasing digits (A009995). Inverse of A263327.

0, 1, 2, 11, 3, 12, 13, 56, 4, 14, 15, 57, 16, 58, 59, 176, 5, 17, 18, 60, 19, 61, 62, 177, 20, 63, 64, 178, 65, 179, 180, 386, 6, 21, 22, 66, 23, 67, 68, 181, 24, 69, 70, 182, 71, 183, 184, 387, 25, 72, 73, 185, 74, 186, 187, 388, 75, 188, 189, 389, 190

Offset: 0

Author

Reinhard Zumkeller, Oct 15 2015

Keywords

• nonn
• fini
• full

Comments

For n = 1..1023: A009995(a(n)) = A262557(n).

The fixed points and cycles of this permutation (up to reversal the same as for its inverse A263327) are listed in A263355. - M. F. Hasler, Dec 11 2019

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..1023

Crossrefs

Cf. A009995, A262557, A263327 (inverse), A263329 (fixed points).

Programs

Haskell

a263328 0 = 0
a263328 n = head [x | x <- [1..1023], a009995' x == a262557 n]

PARI

A263328=vecsort(A263327,,1) \\ Does not include a(0)=0. - M. F. Hasler, Dec 11 2019