A095879 Numbers whose lazy Fibonacci representation has an odd number of summands.

1, 2, 6, 8, 9, 10, 12, 13, 15, 19, 20, 24, 27, 29, 30, 31, 35, 37, 38, 39, 42, 43, 44, 46, 47, 49, 53, 55, 56, 57, 59, 60, 62, 66, 67, 68, 70, 74, 75, 79, 82, 84, 85, 86, 88, 89, 91, 95, 96, 100, 103, 105, 106, 107, 109, 113, 116, 118, 119, 120, 124, 126, 127, 128, 131, 132

Offset: 1

Author

Clark Kimberling, Jun 10 2004

Keywords

• nonn
• base

Examples

			The first few lazy Fibonacci representations (as in A095791) are 1=1, 2=2, 4=3+1, 5=3+2, 6=3+2+1, 7=5+2, 8=5+2+1, so a(1), a(2), a(3) and a(4) are 1, 2, 6 and 8, respectively.
		

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A095880.