Concept information
Terme préférentiel
Golomb sequence
Définition
-
In mathematics, the Golomb sequence, named after Solomon W. Golomb (but also called Silverman's sequence), is a monotonically increasing integer sequence where an is the number of times that n occurs in the sequence, starting with a1 = 1, and with the property that for n > 1 each an is the smallest unique integer which makes it possible to satisfy the condition. For example, a1 = 1 says that 1 only occurs once in the sequence, so a2 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)
Concept générique
Synonyme(s)
- Silverman's sequence
Traductions
-
français
URI
http://data.loterre.fr/ark:/67375/PSR-QV6KLLVJ-8
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}