Answers for "how to find the fibonacci sequence"

fibonacii sequence code

# 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 += 1

fibonacci sequence

public class Numbers {
	public static void FibannaciNumbers(int n) {
        int x = 0;
        int y = 1;
        if(n >= 1) {
            System.out.print(x + " ");
        }
        if(n >= 2) {
            System.out.print(y);
        }
        if (n > 2) {
            for(int a = n - 2; a > 0; a--) {
                int z = y + x;
                System.out.print(" " + z);
                x = y;
                y = z;
            }
        }
    }
}

fibonacii sequence code

# 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 += 1

fibonacci sequence

public class Numbers {
	public static void FibannaciNumbers(int n) {
        int x = 0;
        int y = 1;
        if(n >= 1) {
            System.out.print(x + " ");
        }
        if(n >= 2) {
            System.out.print(y);
        }
        if (n > 2) {
            for(int a = n - 2; a > 0; a--) {
                int z = y + x;
                System.out.print(" " + z);
                x = y;
                y = z;
            }
        }
    }
}