|
%I #13 Feb 07 2023 08:15:04
%S 0,3,4,5,7,11,14,16,17,18,21,22,23,25,26,28,32,33,34,36,40,41,45,48,
%T 50,51,52,54,58,61,63,64,65,69,71,72,73,76,77,78,80,81,83,87,90,92,93,
%U 94,97,98,99,101,102,104,108,110,111,112,114,115,117,121,122,123,125,129,130
%N Numbers whose lazy Fibonacci representation has an even number of summands.
%H Amiram Eldar, <a href="/A095880/b095880.txt">Table of n, a(n) for n = 1..10000</a>
%e 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.
%t 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 *)
%Y Cf. A095791, A095879, A104326.
%K nonn
%O 1,2
%A _Clark Kimberling_, Jun 10 2004
%E a(1) = 0 inserted by _Amiram Eldar_, Jan 18 2020
|
