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

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, 20, 61, 57, 55, 53, 51, 49, 47, 45, 43, 41, 59, 39, 23, 114, 37, 25, 27, 21, 29, 31, 35, 112, 110, 33, 108, 106, 104, 100, 98, 96, 94, 92, 90, 88, 86, 84, 82, 80

Offset

1,2

Comments

If A100707 is a permutation of the natural numbers, then this sequence is its inverse;

A227632 and A227633 give record values and where they occur:

a(A227633(n)) = A227632(n); A227633(n) = A100707(A227632(n)).

Links

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

Prog

b-file
(Haskell)
import qualified Data.Map as Map (null, insert)
import Data.Map (empty, deleteFindMin)
a227617 n = a227617_list !! (n-1)
a227617_list = f 1 empty $ zip a100707_list [1..] where
   f i mp (uv:uvs)
     | Map.null mp = f i (uncurry Map.insert uv mp) uvs
     | y == i      = x : f (i + 1) (uncurry Map.insert uv mp') uvs
     | otherwise   = f i (uncurry Map.insert uv mp) uvs
     where ((y, x), mp') = deleteFindMin mp

Crossrefs

Sequence in context: A087228 A285743 A077216 * A309080 A058357 A176613

Adjacent sequences: A227614 A227615 A227616 * A227618 A227619 A227620

Keyword

nonn

Author

Reinhard Zumkeller, Jul 19 2013

Status

approved