A Sturmian sequence is a right-infinite aperiodic binary sequence whose factor complexity is for every positive integer . By the Morse-Hedlund theorem, this is the smallest possible factor complexity for an aperiodic infinite word.
An example is the sequence arising from the substitution system
yielding , which gives the Sturmian sequence 01001010....
Sturm functions are sometimes also said to form a Sturmian sequence.
More things to try:
Weisstein, Eric W. "Sturmian Sequence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SturmianSequence.html
for every positive integer 
. By the Morse-Hedlund
theorem, this is the smallest possible factor complexity for an aperiodic infinite
word.
,
which gives the Sturmian sequence 01001010....
