Update fibonacci_sequence_recursion.py (TheAlgorithms#1287)

- Fixed minor bugs.
 - Minimized Codes

Author: NikhilCodes

maths/fibonacci_sequence_recursion.py

@@ -2,20 +2,17 @@
 
 
 def recur_fibo(n):
-    if n <= 1:
-        return n
-    else:
-        (recur_fibo(n - 1) + recur_fibo(n - 2))
-
-
-def isPositiveInteger(limit):
-    return limit >= 0
+    """
+    >>> [recur_fibo(i) for i in range(12)]
+    [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
+    """
+    return n if n <= 1 else recur_fibo(n-1) + recur_fibo(n-2)
 
 
 def main():
     limit = int(input("How many terms to include in fibonacci series: "))
-    if isPositiveInteger(limit):
-        print("The first {limit} terms of the fibonacci series are as follows:")
+    if limit > 0:
+        print(f"The first {limit} terms of the fibonacci series are as follows:")
         print([recur_fibo(n) for n in range(limit)])
     else:
         print("Please enter a positive integer: ")