A095879 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(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 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.

CROSSREFS

Cf. A095880.

Sequence in context: A201776 A206476 A077477 * A342751 A120736 A130099

Adjacent sequences: A095876 A095877 A095878 * A095880 A095881 A095882

KEYWORD

nonn,base

AUTHOR

Clark Kimberling, Jun 10 2004

STATUS

approved