Let b_1 = 1 and b_2 = 2 and for n>=3, let b_n be the least integer >b_(n - 1) which can be expressed as the sum of two or more consecutive terms. The resulting sequence is 1, 2, 3, 5, 6, 8, 10, 11, 14, 16, ... (OEIS A005243). Let c_1 = 2 and c_2 = 3, form all possible expressions of the form c_i c_j - 1 for 1<=i

Hofstadter-Conway $10, 000 sequence | Hofstadter's Q-sequence | sum-free set