OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
EXAMPLE
The first few Lazy Fibonacci representations (as in A095791) are 0 = 0, 1 = 1, 2 = 2, 3 = 2 + 1, 4 = 3 + 1, 5 = 3 + 2, 6 = 3 + 2 + 1, 7 = 5 + 2, 8 = 5 + 2 + 1, so that a(1), a(2), a(3), a(4) and a(5) are 0, 3, 4, 5, 7.
MATHEMATICA
lazyFib = Select[Range[0, 1000], SequenceCount[IntegerDigits[#, 2], {0, 0}] == 0 &]; binWt[n_] := DigitCount[n, 2, 1]; -1 + Position[binWt /@ lazyFib, _?(EvenQ[#] &)] // Flatten (* Amiram Eldar, Jan 18 2020 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jun 10 2004
EXTENSIONS
a(1) = 0 inserted by Amiram Eldar, Jan 18 2020
STATUS
approved