|
%I #11 Jul 13 2013 12:03:52
%S 1,2,5906,3,3859,5907,7954,4,2051,3860,4883,5908,6931,7955,8978,5,
%T 1028,2052,3075,3861,4372,4884,5395,5909,6420,6932,7443,7956,8467,
%U 8979,9490,6,517,1029,1540,2053,2564,3076,3587,3862,4117,4373,4628,4885,5140,5396
%N Inverse permutation to A190126.
%C a(A190126(n)) = A190126(a(n)) = n.
%H Reinhard Zumkeller, <a href="/A190127/b190127.txt">Table of n, a(n) for n = 1..10000</a> (full sequence)
%o (Haskell)
%o import Data.List (elemIndex)
%o import Data.Maybe (fromJust)
%o a190127 n = a190127_list !! (n-1)
%o a190127_list =
%o map (succ . fromJust . (`elemIndex` a190126_list)) [1..10000]
%K nonn,base,fini,full
%O 1,2
%A _Reinhard Zumkeller_, May 06 2011
|
