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) 

python fibonacci

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

code fibonacci python

# Program to display the Fibonacci sequence forever

def fibonacci(i,j):
  print(i;fibonacci(j,i+j))
fibonacci(1,1)

python Fibonacci function

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

python fiboncci

n = int(input("say the nth term of the Fibonacci Series"))
a,c = 0,0
b = 1
for ele in range(0,n):
      print(a,end=' ')
      c = a + b
      a = b
      b = c

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