|
%I #4 Dec 07 2015 10:06:20
%S 1,4,13,2,11,42,9,40,3,38,5,36,129,34,127,32,125,30,123,28,121,6,119,
%T 8,117,10,115,12,113,14,111,16,109,392,107,390,105,388,103,386,101,
%U 384,99,382,97,380,95,378,93,376,91,374,89,372,87,370,85,368,83
%N Smallest m such that A238324(m) = n.
%C A238324(a(n)) = n and A238324(m) != n for m < a(n).
%H Reinhard Zumkeller, <a href="/A265327/b265327.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a265327 = (+ 1) . fromJust . (`elemIndex` a238324_list)
%Y Cf. A238324.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Dec 07 2015
|
