A227632 -id:A227632 - cp's OEIS frontend

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

Reinhard Zumkeller, Jul 19 2013

nonn

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)).

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

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

A227633 Where record values occur in A227617.

Original entry on oeis.org

1, 2, 3, 5, 15, 28, 41, 71, 89, 644, 969, 2129, 6380, 9684, 10016, 10055, 160584

Offset: 1

Reinhard Zumkeller, Jul 19 2013

A227617(a(n)) = A227632(n);

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

a227633 n = a227633_list !! (n-1)
-- See A227632: for definition of a227633_list.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Programs

Haskell