In mathematics, the Golomb sequence, named after
Solomon W. Golomb (but also called Silverman's sequence), is a
monotonically increasinginteger sequence where a_{n} is the number of times that n occurs in the sequence, starting with a_{1} = 1, and with the property that for n > 1 each a_{n} is the smallest unique integer which makes it possible to satisfy the condition. For example, a_{1} = 1 says that 1 only occurs once in the sequence, so a_{2} cannot be 1 too, but it can be 2, and therefore must be 2. The first few values are