login
Let s(k) be the finite permutation associated to A175061(k); s(a(n)) is the inverse of s(n).
2

%I #10 Sep 17 2021 11:46:49

%S 1,2,3,4,5,9,7,8,6,13,11,12,10,14,15,27,33,26,32,20,21,22,28,24,30,18,

%T 16,23,29,25,31,19,17,50,48,36,42,38,44,51,49,37,43,39,45,46,47,35,41,

%U 34,40,52,53,57,55,56,54,104,102,150,126,152,128,105,103

%N Let s(k) be the finite permutation associated to A175061(k); s(a(n)) is the inverse of s(n).

%C This sequence is a self-inverse permutation of the positive integers.

%H Rémy Sigrist, <a href="/A347759/b347759.txt">Table of n, a(n) for n = 1..5913</a>

%H Rémy Sigrist, <a href="/A347759/a347759.gp.txt">PARI program for A347759</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%F a(n) < A003422(k) for any n < A003422(k).

%e For n = 42:

%e - the binary expansion of A175061(42) is "100001110000011",

%e - so s(42) = [1, 4, 3, 5, 2],

%e - and s(a(42)) = [1, 5, 3, 2, 4],

%e - and the binary expansion of A175061(a(42)) = "100000111001111",

%e - and a(42) = 37.

%o (PARI) See Links section.

%Y Cf. A003422, A175061, A347758.

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Sep 12 2021