lst = [2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192]
if len(lst) < 2:
    raise ValueError("len < 2")
n = lst[1]/lst[0]
start = lst[0]
def get_progress(start, n):
    val = start
    while 1:
        val *= n
        yield val
progress = get_progress(start, n)
success = True
for x in lst[1:]:
    if x != progress.next():
        success = False
        break
print success

lst = [2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192]
if not lst:
    raise ValueError("lst is empty")
def get_progress(start, n):
    while True:
        yield start
        start *= n
print( all( a==b for a,b in zip( get_progress(lst[0],lst[1%len(lst)]/lst[0]), lst ) ) )

print( not any(lst) or all(...) )

[1, 2, 4]

[-1, 4, -4]

[1]

[1]