|
%I #7 Mar 12 2015 17:59:11
%S 1,2,3,5,4,8,32,15,6,10,25,12,7,18,17,21,34,24,9,31,22,35,27,28,51,40,
%T 33,43,11,46,75,52,41,57,38,60,23,48,36,62,13,65,138,74,44,67,29,69,
%U 61,76,49,83,14,86,55,71,53,26,42,80,16,93,58,98,68,90
%N Smallest number m such that A251604(m) = n.
%C If the conjecture in A251604 is true, this sequence is the inverse permutation.
%H Reinhard Zumkeller, <a href="/A255972/b255972.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a255972 = (+ 1) . fromJust . (`elemIndex` a251604_list)
%Y Cf. A251604.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Mar 12 2015
|
