|
%I #8 Jul 13 2013 12:04:19
%S 1,2,53,5,71,26,9,8,19,72,149,27,91,18,21,17,43,20,29,50,35,150,45,28,
%T 99,92,773,34,171,42,33,32,123,44,49,41,75227,58,137,51,295,48,789,68,
%U 47,46,65,57,891,100,269,90,111,428,921,64,131,172,105,203
%N Smallest number m such that A079878(m) = n.
%C A079878(a(n)) = n and A079878(m) <> n for m < a(n).
%H Reinhard Zumkeller, <a href="/A200087/b200087.txt">Table of n, a(n) for n = 1..860</a>
%o (Haskell)
%o import Data.List (elemIndex)
%o import Data.Maybe (fromJust)
%o a200087 n = (fromJust $ elemIndex n a079878_list) + 1
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Nov 13 2011
|
