1. Turtle graphic, python and colors !
Thue-Morse :
>>> clear() ; reset() ; speed(999999) ; a=0 ; colormode(1)
>>> while a != 2**20:
... pencolor(t[a],t[a+1],t[a+2])
... if t[a] != t[a+1] :
... fd(15)
... else :
... rt(180-360/9)
... a=a+1
>>> clear() ; reset() ; speed(999999) ; a=0 ; colormode(1)
>>> while a != 2**20:
... pencolor(t[a],t[a+2],t[a+4])
... if t[a] != t[a+1] :

2. ... fd(15)
... else :
... rt(180-360/9)
... a=a+1
Kolakoski :
>>> clear() ; reset() ; speed(999999) ; n=0 ; colormode(1)
>>> while n != 2**20:
... if sequence[n] == 1 :
... fd(10)
... else :
... rt(72)
... pencolor(sequence[n]-1,sequence[n+1]-1,sequence[n+2]-1) ; n=n+1

3. >>> clear() ; reset() ; speed(999999) ; n=0 ; colormode(1)
>>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+1]-1,sequence[n+2]-1)
... if sequence[n] == 1 :
... fd(12)
... else :
... rt(90)
... fd(7)
... n=n+1

5. >>> clear() ; reset() ; speed(999999) ; n=0 ; colormode(1)
>>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+2]-1,sequence[n+4]-1)
... if sequence[n] == 1 :
... fd(5)
... else :
... rt(27)
... fd(2)
... n=n+1
>>> clear() ; reset() ; speed(999999) ; n=0 ; colormode(1)
>>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+1]-1,sequence[n+2]-1)
... if sequence[n] == 1 :
... fd(10)
... else :
... rt(60)
... n=n+1

6. >>> clear() ; reset() ; speed(999999) ; n=0 ; colormode(1)
>>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+1]-1,sequence[n+2]-1)
... if sequence[n] == 1 :
... fd(12)
... else :
... rt(60)
... fd(7)
... n=n+1

7. >>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+1]-1,sequence[n+2]-1)
... if sequence[n] == sequence[n+1] :
... fd(10)
... else :
... rt(108) ; fd(10)
... n=n+1
>>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+1]-1,sequence[n+2]-1)
... if sequence[n] == 1 :
... fd(10)
... else :
... rt(60) ; fd(10)
... n=n+1

8. >>> clear() ; reset() ; speed(999999) ; n=0 ; colormode(1)
>>> while n != 2**20:
... pencolor(sequence[n]-1,sequence[n+sequence[n]]-1,sequence[n+2*sequence[n]]-1)
... if sequence[n] == 1 :
... fd(10) ; rt(90)
... else :
... rt(60) ; fd(10)
... n=n+1