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 A331467 #11 Jan 18 2020 03:12:21
%S A331467 0,3,5,8,13,16,21,26,34,37,42,55,60,68,71,89,92,97,110,115,144,149,
%T A331467 157,160,178,181,186,233,236,241,254,259,288,293,301,304,377,382,390,
%U A331467 393,411,414,419,466,469,474,487,492,610,613,618,631,636,665,670,678,681
%N A331467 Numbers with no common terms in their Zeckendorf and dual Zeckendorf representations.
%C A331467 Include all the Fibonacci numbers > 2.
%C A331467 The number of terms <= F(k), the k-th Fibonacci number, is A000931(k + 5), for k > 3.
%H A331467 Amiram Eldar, <a href="/A331467/b331467.txt">Table of n, a(n) for n = 1..1000</a>
%F A331467 A331466(a(n)) = 0.
%e A331467 3 is a term since its Zeckendorf representation is 100 (i.e., F(4)), its dual Zeckendorf representation is 11 (i.e., F(2) + F(3)), and there is no position with the digit 1 common to both representations (i.e., the Fibonacci summands are different).
%t A331467 m = 10^4; zeck = Select[Range[0, m], BitAnd[#, 2 #] == 0 &]; dualZeck = Select[Range[0, m], SequenceCount[IntegerDigits[#, 2], {0, 0}] == 0 &]; s = DigitCount[BitAnd[zeck[[#]], dualZeck[[#]]] & /@ Range[Min[Length[zeck], Length[dualZeck]]], 2, 1]; -1 + Position[s, _?(# == 0 &)] // Flatten
%Y A331467 Cf. A000045, A000931, A007895, A014417, A104326, A112310, A331466.
%K A331467 nonn,base
%O A331467 1,2
%A A331467 _Amiram Eldar_, Jan 17 2020