|
%I #6 Jun 30 2015 04:54:51
%S 1,56,48,147,148,49,55,2,8,14,20,26,32,38,33,27,21,15,9,3,66,50,149,
%T 158,177,57,74,88,102,116,130,45,44,131,117,103,89,75,58,178,157,150,
%U 51,65,4,10,16,22,28,34,39,139,125,111,97,83,496,186,196,163,173
%N Smallest m such that A259429(m) = 2*n-1.
%C Sequence is defined for all numbers iff A259429 is a permutation of the odd numbers;
%C A259429(a(n)) = 2*n-1.
%H Reinhard Zumkeller, <a href="/A259537/b259537.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a259537 = (+ 1) . fromJust . (`elemIndex` a259429_list) . subtract 1 . (* 2)
%Y Cf. A259429.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jun 30 2015
|
