Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01298128n
Noun Concept
JA
バウム–スウィート数列  バウム–スウィート数列
EN
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;for n ≥ 0. Wikipedia
Sources
Wikidata
JA
バウム–スウィート数列
Wikidata Alias
JA
バウム–スウィート数列

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License