import math

p=[]
d=''
def binc(n):
    k=0

    for i in range(n+1):
        bin_c=(math.factorial(n))/((math.factorial(k)*(math.factorial(n-k))))
        p.append(str(int(bin_c)))
        k+=1

    print(p)

binc(6)
def final_formula(list_,m):
    k=0
    if int(len(list_))%2==1:
        l=(int(len(list_)-1)/2)
        f=(int(len(list_)-l))
        d=list_[-1:(f-1)]
        h=list_[1:(f-1)]
        while k!=m:
            for i in h:
                i+'a^{0}b{1}'.format(str(m-k),str(k))

            k+=1


final_formula(p,6)

for index, value in enumerate(h):
    h[index] = '{}a^{}b{}'.format(value, str(m-k), str(k))