

A095880


Numbers whose lazy Fibonacci representation has an even number of summands.


2



0, 3, 4, 5, 7, 11, 14, 16, 17, 18, 21, 22, 23, 25, 26, 28, 32, 33, 34, 36, 40, 41, 45, 48, 50, 51, 52, 54, 58, 61, 63, 64, 65, 69, 71, 72, 73, 76, 77, 78, 80, 81, 83, 87, 90, 92, 93, 94, 97, 98, 99, 101, 102, 104, 108, 110, 111, 112, 114, 115, 117, 121, 122, 123, 125, 129, 130
(list;
graph;
refs;
listen;
history;
text;
internal format)



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

Cf. A095791, A095879, A095881, A104326.
Sequence in context: A216570 A101762 A139455 * A076497 A137950 A330100
Adjacent sequences: A095877 A095878 A095879 * A095881 A095882 A095883


KEYWORD

nonn


AUTHOR

Clark Kimberling, Jun 10 2004


EXTENSIONS

a(1) = 0 inserted by Amiram Eldar, Jan 18 2020


STATUS

approved



