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)) # 8fibonacci series in python
~~ This is the best Fibonacci sequence generator as you have all the option that
till what number should this go on for ~~
a = 0
b = 1
f = 1
n = int(input("Till what number would you like to see the fibonacci sequence: "))
while b <= n:
f = a+b
a = b
b = f
print(a)fibonacci series in python
#Recursive fibonnaci series
def fib(n,arr):
if n == 0 or n == 1:
return 1
else:
arr.append(fib(n-1,arr) + fib(n-2,arr))
return fib(n-1,arr) + fib(n-2,arr)
n = 10
arr = [1, 1]
print(fib(n-1,arr))
bl = set(arr)
bb = list(bl)
bb.sort()
print([1] + bb)fibonacci series in python
#Recursive Solutions
def fibo(n):
if n<=1: return 1
return fibo(n-1)+fibo(n-2)
fibo(5)
#OUTPUT:
#120fibonacci series in python
# Program to display the Fibonacci sequence up to n-th term
nterms = int(input("How many terms? "))
# first two terms
n1, n2 = 0, 1
count = 0
# check if the number of terms is valid
if nterms <= 0:
print("Please enter a positive integer")
elif nterms == 1:
print("Fibonacci sequence upto",nterms,":")
print(n1)
else:
print("Fibonacci sequence:")
while count < nterms:
print(n1)
nth = n1 + n2
# update values
n1 = n2
n2 = nth
count += 1Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
