Baum–Sweet sequence
id:
baum-sweet-sequence-192-13082350
title:
Baum–Sweet sequence
text:
In mathematics the Baum–Sweet sequence is an infinite automatic sequence of 0s and 1s defined by the rule: for n ≥ 0. For example, b4 = 1 because the binary representation of 4 is 100, which only contains one block of consecutive 0s of length 2; whereas b5 = 0 because the binary representation of 5 is 101, which contains a block of consecutive 0s of length 1. Starting at n = 0, the first few terms of the Baum–Sweet sequence are:
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical sequence of 1s and 0s
original url:
https://en.wikipedia.org/wiki/Baum%E2%80%93Sweet_sequence
date created:
date modified:
2024-03-12T15:41:51Z
main entity:
{"identifier":"Q735489","url":"https://www.wikidata.org/entity/Q735489"}
image:
fields total:
13
integrity:
14