|
%I #4 Apr 28 2014 02:21:06
%S 1,3,95,8,22,121,144,24,27,60,67,73,66,79,163,196,148,150,220,80,181,
%T 173,178,197,213,203,194,202,261,374,304,387,645,295,447,379,290,420,
%U 362,506,515,878,520,836,941,495,594,754,884,958,501,485,561,407,467
%N Smallest number m such that A229037(m) = n.
%C A229037(a(n)) = n and A229037(m) <> n for m < a(n).
%H Reinhard Zumkeller, <a href="/A241752/b241752.txt">Table of n, a(n) for n = 1..1000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a241752 = (+ 1) . fromJust . (`elemIndex` a229037_list)
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Apr 28 2014
|
