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 A356326 #15 Aug 05 2022 15:32:36 %S A356326 0,0,0,0,-1,0,0,0,0,-1,-3,-3,-1,0,0,0,0,4,0,0,0,0,-1,-3,-3,-1,-8,-8, %T A356326 -8,-8,-1,-3,-3,-1,0,0,0,0,4,0,0,0,0,12,10,10,12,0,0,0,0,4,0,0,0,0,-1, %U A356326 -3,-3,-1,-8,-8,-8,-8,-1,-3,-3,-1,-21,-21,-21,-21,-17 %N A356326 The terms in the negaFibonacci representation of a(n) are the terms in common in the negaFibonacci representations of n and -n. %H A356326 Rémy Sigrist, <a href="/A356326/b356326.txt">Table of n, a(n) for n = 0..10946</a> %H A356326 Rémy Sigrist, <a href="/A356326/a356326.gp.txt">PARI program</a> %H A356326 Wikipedia, <a href="https://en.wikipedia.org/wiki/NegaFibonacci_coding">NegaFibonacci coding</a> %H A356326 <a href="/index/Z#Zeckendorf">Index entries for sequences related to Zeckendorf expansion of n</a> %F A356326 a(n) = 0 iff n belongs to A062877. %F A356326 a(n) = A356327(A215024(n) AND A215025(n)) (where AND denotes the bitwise AND operator). %F A356326 Empirically: %F A356326 - a(A000045(k)+m) = a(A000045(k+1)-m) for k >= 0, m = 0..A000045(k+1)-A000045(k). %e A356326 For n = 11: %e A356326 - using F(-k) = A039834(k): %e A356326 - 11 = F(-1) + F(-4) + F(-7), %e A356326 - -11 = F(-4) + F(-6), %e A356326 - so a(11) = F(-4) = -3. %o A356326 (PARI) See Links section. %Y A356326 Cf. A000045, A039834, A062877, A215024, A215025, A356325, A356327. %K A356326 sign,base %O A356326 0,11 %A A356326 _Rémy Sigrist_, Aug 03 2022