A258827 Smallest m such that A258767(m) = n.

1, 4, 6, 5, 10, 7, 2, 8, 12, 9, 20, 11, 13, 3, 16, 14, 35, 15, 36, 17, 18, 19, 21, 23, 30, 24, 38, 25, 26, 29, 39, 33, 37, 34, 31, 22, 43, 41, 44, 32, 42, 40, 50, 47, 45, 28, 27, 46, 49, 48, 51, 53, 74, 52, 59, 54, 63, 55, 56, 58, 84, 57, 62, 65, 60, 64, 69

Offset: 1

Author

Reinhard Zumkeller, Jun 11 2015

Keywords

• nonn

Comments

If A258767 is a permutation, this sequence is its inverse.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A258767, A258768 (fixed points).

Programs

Haskell

import Data.List (elemIndex); import Data.Maybe (fromJust)
a258827 = (+ 1) . fromJust . (`elemIndex` a258767_list)