A256628 Index i such that A251622(i) = n, or 0 if no such i exists.

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

Offset

1,2

Comments

If A251622 is a permutation, as conjectured, then this is the inverse permutation.

Links

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

Prog

(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a256628 = (+ 1) . fromJust . (`elemIndex` a251622_list)

Crossrefs

Cf. A251622 (conjectured inverse).

Sequence in context: A159988 A134880 A117534 * A112990 A169848 A026201

Adjacent sequences: A256625 A256626 A256627 * A256629 A256630 A256631

Keyword

nonn

Author

Reinhard Zumkeller, Apr 05 2015

Status

approved