Concept information
Término preferido
Baum-Sweet sequence
Definición
-
In mathematics the Baum–Sweet sequence is an infinite automatic sequence of 0s and 1s defined by the rule:
- bn = 1 if the binary representation of n contains no block of consecutive 0s of odd length;
- bn = 0 otherwise;
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Baum%E2%80%93Sweet_sequence)
Concepto genérico
En otras lenguas
-
francés
-
suite de Baum et Sweet
URI
http://data.loterre.fr/ark:/67375/PSR-JTW5QQPH-J
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}