cp's OEIS Frontend

A227617 Smallest m such that A100707(m) = n.

%I A227617 #4 Jul 19 2013 14:17:07
%S A227617 1,2,5,3,19,8,4,6,17,15,13,11,9,7,34,30,28,26,32,24,22,10,12,14,16,18,
%T A227617 20,61,57,55,53,51,49,47,45,43,41,59,39,23,114,37,25,27,21,29,31,35,
%U A227617 112,110,33,108,106,104,100,98,96,94,92,90,88,86,84,82,80
%N A227617 Smallest m such that A100707(m) = n.
%C A227617 If A100707 is a permutation of the natural numbers, then this sequence is its inverse;
%C A227617 A227632 and A227633 give record values and where they occur:
%C A227617 a(A227633(n)) = A227632(n); A227633(n) = A100707(A227632(n)).
%H A227617 Reinhard Zumkeller, <a href="/A227617/b227617.txt">Table of n, a(n) for n = 1..10000</a>
%o A227617 b-file
%o A227617 (Haskell)
%o A227617 import qualified Data.Map as Map (null, insert)
%o A227617 import Data.Map (empty, deleteFindMin)
%o A227617 a227617 n = a227617_list !! (n-1)
%o A227617 a227617_list = f 1 empty $ zip a100707_list [1..] where
%o A227617    f i mp (uv:uvs)
%o A227617      | Map.null mp = f i (uncurry Map.insert uv mp) uvs
%o A227617      | y == i      = x : f (i + 1) (uncurry Map.insert uv mp') uvs
%o A227617      | otherwise   = f i (uncurry Map.insert uv mp) uvs
%o A227617      where ((y,x), mp') = deleteFindMin mp
%K A227617 nonn
%O A227617 1,2
%A A227617 _Reinhard Zumkeller_, Jul 19 2013