This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A356332 #9 Aug 05 2022 15:35:36 %S A356332 0,1,2,3,4,10,6,7,8,9,5,11,12,31,27,23,16,17,28,19,20,21,22,15,24,30, %T A356332 26,14,18,29,25,13,32,33,86,82,65,71,38,78,61,57,42,51,44,45,72,83,74, %U A356332 62,50,43,75,53,54,55,56,41,58,77,70,40,49,63,64,36,79,85 %N A356332 Bit-reverse the odd part of the negaFibonacci representation of -n (and negate): a(n) = -A356327(A057889(A215025(n))). %C A356332 This sequence is a self-inverse permutation of the nonnegative integers similar to A343150, A344682, A345201 and A356331. %H A356332 Rémy Sigrist, <a href="/A356332/b356332.txt">Table of n, a(n) for n = 0..10945</a> %H A356332 Rémy Sigrist, <a href="/A356332/a356332.gp.txt">PARI program</a> %H A356332 <a href="/index/Z#Zeckendorf">Index entries for sequences related to Zeckendorf expansion of n</a> %H A356332 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A356332 a(a(n)) = n. %F A356332 a(n) < A000045(2*k+1) iff n < A000045(2*k+1). %e A356332 The first terms, alongside the corresponding negaFibonacci representations, are: %e A356332 n a(n) nega(-n) nega(-a(n)) %e A356332 -- ---- -------- ----------- %e A356332 0 0 0 0 %e A356332 1 1 10 10 %e A356332 2 2 1001 1001 %e A356332 3 3 1000 1000 %e A356332 4 4 1010 1010 %e A356332 5 10 100101 101001 %e A356332 6 6 100100 100100 %e A356332 7 7 100001 100001 %e A356332 8 8 100000 100000 %e A356332 9 9 100010 100010 %e A356332 10 5 101001 100101 %e A356332 11 11 101000 101000 %e A356332 12 12 101010 101010 %e A356332 13 31 10010101 10101001 %o A356332 (PARI) See Links section. %Y A356332 Cf. A000045, A057889, A215025, A343150, A344682, A345201, A356327, A356331. %K A356332 nonn,base %O A356332 0,3 %A A356332 _Rémy Sigrist_, Aug 04 2022