|
%I #4 Apr 24 2015 09:45:06
%S 1,2,3,4,5,6,7,8,9,10,11,13,12,16,15,18,14,20,17,24,23,22,19,28,21,26,
%T 25,33,27,40,29,31,35,36,30,42,32,44,37,38,34,50,39,46,45,48,41,52,43,
%U 54,47,57,49,61,51,64,55,59,53,68,56,66,58,70,60,72,62
%N Smallest m, such that A257340(m) = n.
%C A257340(a(n)) = n.
%H Reinhard Zumkeller, <a href="/A257456/b257456.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a257456 = (+ 1) . fromJust . (`elemIndex` a257340_list)
%Y Cf. A257340.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Apr 24 2015
|
