A095259 Smallest m such that A095258(m) = n.

1, 3, 2, 4, 10, 5, 21, 9, 6, 16, 18, 14, 19, 39, 25, 26, 11, 8, 51, 38, 46, 56, 20, 15, 17, 34, 7, 48, 50, 37, 78, 27, 67, 12, 52, 33, 64, 66, 69, 44, 169, 53, 134, 93, 95, 40, 22, 28, 47, 41, 29, 89, 91, 54, 96, 60, 70, 99, 312, 43, 202, 80, 157, 55, 63, 92, 130, 13

Offset: 1

Author

Reinhard Zumkeller, May 31 2004

Keywords

• nonn

Comments

Inverse of A095258, if the conjecture is true, that this is a permutation: a(A095258(n)) = A095258(a(n)) = n;

A095261(n) = a(a(n)).

Links

• Index entries for sequences that are permutations of the natural numbers

Programs

Haskell

import Data.List (elemIndex); import Data.Maybe (fromJust)
a095259 = (+ 1) . fromJust . (`elemIndex` a095258_list)
-- Reinhard Zumkeller, Dec 31 2014

Extensions

Revised version: Reinhard Zumkeller, Dec 31 2014