PYTHON

fibonacci python

# Implement the fibonacci sequence
	# (0, 1, 1, 2, 3, 5, 8, 13, etc...)
	def fib(n):
		if n== 0 or n== 1:
			return n
		return fib (n- 1) + fib (n- 2) 

fibonacci sequence python

# 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

fibonacci sequence python

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

Fibonacci Number In Python

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])

fibonacci sequence python

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)

fibonacci python

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

Fibonacci Sequence Python

startNumber = int(raw_input("Enter the start number here "))
endNumber = int(raw_input("Enter the end number here "))

def fib(n):
    if n < 2:
        return n
    return fib(n-2) + fib(n-1)

print map(fib, range(startNumber, endNumber))