Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #19 May 04 2015 11:31:10
%S 1,2,3,5,8,4,30,6,10,7,123,12,201,31,9,13,300,11,825,16,34,124,946,14,
%T 27,202,21,32,3094,15,7060,18,127,301,54,20,13528,826,205,17,28659,33,
%U 40811,125,25,947,46658,19,81,28,304,203,57450,22,134,38,829,3095
%N Smallest m such that A257218(m) = n.
%C A257218(a(n)) = n and A257218(m) != n for m < a(n);
%C it appears that all records > 8 occur at primes;
%C for p prime: a(p)-1 = index of the smallest multiple of p in A257218.
%H Hiroaki Yamanouchi, <a href="/A257122/b257122.txt">Table of n, a(n) for n = 1..72</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a257122 = (+ 1) . fromJust . (`elemIndex` a257218_list)
%Y Cf. A257218.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Apr 25 2015
%E a(41)-a(58) from _Hiroaki Yamanouchi_, May 04 2015