A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s, t)-additive sequences are a further generalization in which each term has exactly s representations as the sum of t distinct earlier numbers. It is conjectured that 0-additive sequences ultimately have periodic differences of consecutive terms.

greedy algorithm | Stöhr sequence | sum-free set | Ulam sequence