|
%I #4 Apr 17 2014 16:33:24
%S 2,1,0,5,10,9,14,19,15,20,28,24,23,34,27,41,37,33,44,40,36,47,61,45,
%T 53,67,48,56,70,54,62,73,57,68,94,78,71,97,81,74,100,87,77,106,90,80,
%U 109,93,86,115,96,89,121,99,146,124,105,152,127,108,155,130
%N Smallest number m such that A240808(m) = n.
%C A240808(a(n)) = n and A240808(m) <> n for m < a(n).
%H Reinhard Zumkeller, <a href="/A241218/b241218.txt">Table of n, a(n) for n = 0..20000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a241218 = fromJust . (`elemIndex` a240808_list)
%Y Cf. A120511.
%K nonn
%O 0,1
%A _Reinhard Zumkeller_, Apr 17 2014
|
