Ulam Sequences and Ulam Sets

Abstract

The Ulam sequence is given by a 1 = 1, a 2 = 2, and then, for n ≥ 3, the element an is defined as the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives the sequence 1, 2, 3, 4, 6, 8, 11, 13, 16, . . . , which has a mysterious quasi-periodic behavior that is not understood. Ulam's definition naturally extends to higher dimensions: for a set of initial vectors {v 1 , . . . , v k } ⊂ R n , we define a sequence by repeatedly adding the smallest elements that can be uniquely written as the sum of two distinct vectors already in the set. The resulting sets have very rich structure that turns out to be universal for many commuting binary operations. We give examples of different types of behavior, prove several universality results, and describe new unexplained phenomena.