0

Hi I'm trying to find a way to find the first avogadro cipher whose digital sum exceeds 100,

I've come to:

```
#!/usr/bin/python
def dig_sum(n):
lst = list(str(n))
ln = len(lst)
sm = 0
while(i < ln):
sm += int(lst[i])
return sm
def avo(i,j,k,c):
k = j
j = i + j
i = k
arr.append(j)
c += 1
print arr
if(dig_sum(i) > 100):
print "solved:" + arr[c]
else:
avo(i,j,k,c)
i = 1 #num 1
j = 1 #num 2
k = 0 #reserve
c = 1 #turns
arr = [i,j]
avo(i,j,k,c)
```

but it just stops working after it has printed 21 :o

what have I done wrong?