OFFSET
1,2
COMMENTS
Include all the Fibonacci numbers > 2.
The number of terms <= F(k), the k-th Fibonacci number, is A000931(k + 5), for k > 3.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1000
FORMULA
A331466(a(n)) = 0.
EXAMPLE
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).
MATHEMATICA
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
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amiram Eldar, Jan 17 2020
STATUS
approved