: Matemáticas: Golomb sequence

mathematical analysis > calculus > sequence > integer sequence > Golomb sequence

Golomb sequence

In mathematics, the Golomb sequence, named after Solomon W. Golomb (but also called Silverman's sequence), is a monotonically increasing integer sequence where a_n is the number of times that n occurs in the sequence, starting with a₁ = 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 says that 1 only occurs once in the sequence, so a₂ cannot be 1 too, but it can be 2, and therefore must be 2.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Golomb_sequence)

http://data.loterre.fr/ark:/67375/PSR-QV6KLLVJ-8

RDF/XML TURTLE JSON-LD Creado 25/7/23, última modificación 18/10/24

Loterre