|
%I #7 Nov 17 2012 15:51:03
%S 4,1,2,3,21,5,15,7,33,22,66,11,77,13,39,26,57,17,51,19,69,46,95,23,
%T 145,465,155,435,93,29,87,31,185,777,259,555,222,37,111,74,129,41,123,
%U 43,141,94,215,47,265,1113,371,795,318,53,159,106,177,118,354,59,366,61
%N Smallest m such that A072594(m) = n.
%C A072594(a(n)) = n and A072594(m) <> n for m < a(n).
%H R. Zumkeller, <a href="/A127812/b127812.txt">Table of n, a(n) for n = 0..1000</a>
%o (Haskell)
%o import Data.List (elemIndex)
%o import Data.Maybe (fromJust)
%o a127812 = (+ 1) . fromJust . (`elemIndex` a072594_list)
%o -- _Reinhard Zumkeller_, Nov 17 2012
%K nonn
%O 0,1
%A _Reinhard Zumkeller_, Feb 02 2007
|
