%I #5 Apr 17 2015 01:33:37
%S 1,4,3,11,18,13,7,23,39,42,64,27,43,29,15,47,78,141,142,212,278,83,
%T 241,55,86,149,150,59,90,61,31,95,158,285,286,541,542,1051,796,931,
%U 483,167,485,295,422,171,489,111,174,301,302,557,558,179,497,119,182
%N Smallest number m such that A248756(m) = n.
%C A248756(a(n)) = n and A248756(m) != n for m < a(n).
%H Reinhard Zumkeller, <a href="/A257078/b257078.txt">Table of n, a(n) for n = 1..1000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a257078 = (+ 1) . fromJust . (`elemIndex` a248756_list)
%Y Cf. A248756.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Apr 15 2015