|
%I #21 Jul 05 2014 11:12:02
%S 1,2,3,4,6,7,5,9,11,8,10,12,14,15,13,18,20,16,24,19,17,21,23,25,22,27,
%T 29,26,28,30,32,33,31,35,37,38,36,41,43,39,47,51,34,40,42,44,46,48,45,
%U 50,52,49,53,55,57,54,58,60,61,56,65,63,66,59,64,69,72
%N Inverse permutation to A239965.
%C a(A239965(n)) = A239965(a(n)) = n;
%C A018252(a(n)) = A240024(n).
%H Reinhard Zumkeller, <a href="/A238862/b238862.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a238862 = (+ 1) . fromJust . (`elemIndex` a239965_list)
%Y Cf. A239943 (fixed points).
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Apr 30 2014
|
