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

%I #17 Sep 18 2021 10:13:50

%S 1,2,3,4,5,7,6,8,9,10,11,13,12,14,15,19,18,17,16,21,20,23,22,24,25,28,

%T 29,26,27,30,31,32,33,34,35,39,38,37,36,42,41,40,46,44,48,43,47,45,53,

%U 54,55,52,49,50,51,58,61,56,60,59,57,63,62,65,64,66,68

%N Let s(k) be the finite permutation associated to A109299(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="/A347758/b347758.txt">Table of n, a(n) for n = 1..10000</a>

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

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

%e For n = 42:

%e - A109299(42) = 2^5 * 3^3 * 5^4 * 7^1 * 11^2,

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

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

%e - and A347752(a(42)) = 2^4 * 3^5 * 5^2 * 7^3 * 11^1 = A109299(40),

%e - hence a(42) = 40.

%o (PARI) See Links section.

%Y Cf. A109299, A347759.

%K nonn,look

%O 1,2

%A _Rémy Sigrist_, Sep 12 2021