login
a(0) = 0, and for any n > 0, a(n) = A022290(A059893(A003754(n+1))).
6

%I #26 Jul 29 2021 13:22:50

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

%T 22,30,21,29,27,24,32,41,36,49,34,47,44,39,52,33,46,43,38,51,42,37,50,

%U 35,48,45,40,53,54,75,70,62,83,68,60,81,57,78,73,65,86,67

%N a(0) = 0, and for any n > 0, a(n) = A022290(A059893(A003754(n+1))).

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

%C The construction of this sequence is similar to that of A343150; we start with a representation of a number n as a sum of distinct positive Fibonacci numbers, through some binary encoding, and we reverse some of the bits in a bijective way to obtain a(n).

%H Rémy Sigrist, <a href="/A344682/b344682.txt">Table of n, a(n) for n = 0..10944</a>

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

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

%p # after renaming a(n) to A059893(n) in A059893...

%p A344682 := proc(n)

%p if n = 0 then

%p 0;

%p else

%p A022290(A059893(A003754(n+1))) ;

%p end if;

%p end proc:

%p seq(A344682(n),n=0..70) ; # _R. J. Mathar_, Jul 29 2021

%o (PARI) See Links section.

%Y Cf. A003754, A059893, A022290, A343150.

%K nonn,look,base

%O 0,3

%A _Rémy Sigrist_, Jun 08 2021