%I #27 Aug 09 2017 23:09:40

%S 1,3,2,6,7,4,13,5,14,9,8,11,12,18,25,26,16,24,27,19,28,21,29,10,23,30,

%T 39,15,36,34,55,54,32,48,56,17,35,31,38,57,58,59,75,22,43,20,45,47,49,

%U 41,50,94,52,107,109,53,40,61,103,70,66,105,60,63,37,64

%N a(n) = the position of n in A160855 or 0 if n is not in A160855.

%C If A160855 is a permutation of the positive integers then a(n) > 0 and A160855(a(n)) = n and a(A160855(n)) = n.

%H Reinhard Zumkeller, <a href="/A236341/b236341.txt">Table of n, a(n) for n = 1..10000</a>

%t Block[{nn = 66, a = {}}, Do[k = 1; While[Or[MemberQ[a, k], SequencePosition[IntegerDigits[Total@ a + k, 2], #] == {}], k++] &@ IntegerDigits[n, 2]; AppendTo[a, k], {n, 3 nn}]; Take[#, nn] &@ SortBy[MapIndexed[{First@ #2, #1} &, a], Last][[All, 1]]] (* _Michael De Vlieger_, Aug 09 2017 *)

%o (Haskell)

%o import Data.List (elemIndex); import Data.Maybe (fromJust)

%o a236341 = (+ 1) . fromJust . (`elemIndex` a160855_list)

%Y Cf. A160855.

%K nonn,look

%O 1,2

%A _Reinhard Zumkeller_, Mar 13 2014

%E Better definition from _Michael De Vlieger_, Aug 09 2017