Draft:Bpow60

Find an ordered list of positive integers, <m>a_1, a_2,\ldots</m> with the fewest possible integers, satisfying all the following properties:

1. Every positive integer is the sum of numbers from the list,
2. no number on the list appears more than once in any one sum, and
3. no two consecutive numbers on the list, that is, <m>a_k</m>, <m>a_{k+1}</m>, appear in any one sum.

(Note that an integer is considered to be the sum of one number on the list if it is actually on the list. Also, for the terminally picky, "fewest possible" refers to inclusion, not to cardinality.)

In symbols, for any positive integer <m>n</m>

<m>n = \sum b_i a_i</m>

where the sum runs over all elements of the list, <m>b_i = 0</m> or 1, and <m>b_i b_{i+1} = 0</m>.

Problem by Alberto L Delgado, from the now extinct Bradley Problem of the Week.