N个斐波那契数列的输出，要列表

数学中有一个有名的数列，叫做斐波那契数列，它的第n项的值(n >= 0)：

F(0)=1，F(1)=1，F(n)=F(n-1)+F(n-2) (n >=2)

（要求：使用一个长度为50的列表存放斐波那契数列的前面50项，将这个列表打印出来）

a = 0
b = 1
f=[]
for i in range(50):
    a, b = b, a + b
    f.append(a)
print(f)

#
[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049, 12586269025]

lenght = int(input("请输入斐波那契数列长度："))
list_sequence = [1, 1]
for __ in range(lenght - 2):
    element = list_sequence[-2] + list_sequence[-1]
    list_sequence.append(element)
print(list_sequence)

斐波那契数列F(0)=0吧

print('——————————斐波那契数列——————————')
fib = []
i = int(input('请输入需要的数列个数：'))
for j in range(i):
     if j == 0:
          x = 0
     elif j == 1:
          x = 1
     else:
          x = fib[j-1] + fib[j-2]
     fib.append(x)
print(fib)

——————————斐波那契数列——————————
请输入需要的数列个数：50
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049]

```