Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Apr 17 2015 16:04:25
%S 0,1,2,3,69,5,9,7,40,171,365,11,805,13,217,49,637,17,1519,19,671,125,
%T 403,23,143,2891,1199,1351,917,29,559,31,799,1099,323,14443,949,37,
%U 803,5027,679,41,2167,43,1837,6253,341,47,253,2327,169,4697,2021,53
%N Smallest number m such that A248737(m) = n.
%C A248737(a(n)) = n and A248737(m) != n for m < a(n).
%H Reinhard Zumkeller, <a href="/A257173/b257173.txt">Table of n, a(n) for n = 0..90</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a257173 = fromJust . (`elemIndex` a248737_list)
%Y Cf. A248737.
%K nonn
%O 0,3
%A _Reinhard Zumkeller_, Apr 17 2015