def fib(n: int) -> int:

    if n in {0,1}:

        return n

    a,b = 0,1

    for i in range(n-1):

        a,b = b,a+b

    return b

def fib(n):

    a = 0

    b = 1

​

    print(a)    

    print(b)

​

    for i in range(2, n):

        print(a+b)

        a, b = b, a + b

​

fib(7) #first seven nubers of Fibonacci sequence

def fibonacci(n):

    if n <= 0:

        return []

    elif n == 1:

        return [0]

    elif n == 2:

        return [0, 1]

    else:

        fib = [0, 1]

        for i in range(2, n):

            fib.append(fib[-1] + fib[-2])

        return fib

# WARNING: this program assumes the

# fibonacci sequence starts at 1

def fib(num):

  """return the number at index num in the fibonacci sequence"""

  if num <= 2:

    return 1

  return fib(num - 1) + fib(num - 2)

​

​

print(fib(6))  # 8

# Call fib(range) for loop iteration

def fib(rng):

  a, b, c = 0, 1, 0

  for i in range(rng):

    c = a + b; a = b; b = c

    print(a)

fib(10)

num = 1

num1 = 0

num2 = 1

import time

for i in range(0, 10):

    print(num)

    num = num1 + num2

    num1 = num2

    num2 = num

    time.sleep(1)

​

def fibNum(n):

   f = [0] * n

   f[0] = 0

   f[1] = 1

   for x in range(2, n):

      f[x] = f[x-1]+f[x-2]

   return (f[n-1])

​

​

>>> def fib(n):    # write Fibonacci series up to n

...     """Print a Fibonacci series up to n."""

...     a, b = 0, 1

...     while a < n:

...         print(a, end=' ')

...         a, b = b, a+b

...     print()

...

>>> # Now call the function we just defined:

... fib(2000)

0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597