cp's OEIS Frontend

Python

# compute curling number of L
def curl(L):
    n = len(L)
    m = 1 #max nr. of repetitions at the end
    k = 1 #length of repeating block
    while(k*(m+1) <= n):
        good = True
        i = 1
        while(i <= k and good):
            for t in range(1, m+1):
                if L[-i-t*k] != L[-i]:
                    good = False
            i = i+1
        if good:
            m = m+1
        else:
            k = k+1
    return m
# compute lengths of first n glue strings
def A091579_list(n):
    Promote = [1] #Keep track of promoted elements
    L = [2]
    while len(Promote) <= n:
        c = curl(L)
        if c < 2:
            Promote = Promote+[len(L)+1]
            c = 2
        L = L+[c]
    return [Promote[i+1]-Promote[i] for i in range(n)]
# Dion Gijswijt, Oct 08 2015