Abed hat dieses Bild (verkleinerte Version) angehängt:
1: 2: 3: 4: 5: 6:
for bits in range(1, 11): num = 0 for n in range(2^bits, 2^(bits+1)): s = bin(n); if s.find('11') == -1: num+=1; print str(bits) + ": " + str(num);
1: 2: 3: 4: 5: 6: 7: 8: 9: 10:
1: 1 2: 2 3: 3 4: 5 5: 8 6: 13 7: 21 8: 34 9: 55 10: 89