更像的斐波那切数列

上条说了斐波那切数列的画法。不过不太像我们现实中的向日葵的排列情况。
为了画的更像一些我们又改动了一下。

from turtle import *
from random import random,randint
speed = 0

def huaxian(amount):
    a1 = 0
    a2 = 1
    tem_he = 0
    shulie = []
    for i in range(1,amount+1):
        #end=''的效果是在一行显示输出的值
        #print(i,end='')
        tem_he = a1 +a2
        a1 = a2
        a2 = tem_he
        shulie.append(tem_he)
    #print(shulie)
    for i in range(1,amount):
#         for n in range(4):
#             forward(shulie[i])
#             left(90)
        circle(shulie[i],90)
#         write(shulie[i],font = ("微软雅黑",i+2))
amount = int(input('请输入你要体现的斐波那契数列的层数'))
huaxian(amount)
for i in range(amount):
    huaxian
    penup()
    home()
    jiaodu = 360/amount
    left(jiaodu * i)
    pendown()
    huaxian(amount)
mainloop()