Program to find Nth odd Fibonacci Number

Program for Fibonacci numbers in PL/SQL

Last Updated : 13 Mar, 2023

The Fibonacci numbers are the numbers in the following integer sequence.

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

In mathematical terms, the sequence F_n of Fibonacci numbers is defined by the recurrence relation

F_n = F_n-1 + F_n-1

with seed values

F₀= 0 and F₁ = 1.
Given a number n, print n-th Fibonacci Number.

Input  : n = 2
Output : 1

Input  : n = 9
Output : 34

Below is the required implementation:

declare
  
-- declare variable first = 0, 
-- second = 1 and temp of datatype number 
first number := 0; 
second number := 1; 
temp number; 
  
n number := 5; 
i number; 
  
begin
  
    dbms_output.put_line('Series:'); 
  
--print first two term first and second 
    dbms_output.put_line(first); 
    dbms_output.put_line(second); 
  
-- loop i = 2 to n 
    for i in 2..n 
    loop 
        temp:=first+second; 
  
first := second; 
second := temp; 
  
--print terms of fibonacci series 
    dbms_output.put_line(temp); 
end loop; 
  
end; 
--Program End 

Output:

0 1 1 2 3 5

Program to find Nth odd Fibonacci Number

V

vt_m

Improve

Article Tags :

Practice Tags :

Similar Reads

Program to find Nth odd Fibonacci Number

Given an integer N. The task is to find the Nth odd Fibonacci number.The odd number fibonacci series is as: 1, 1, 3, 5, 13, 21, 55, 89, 233, 377, 987, 1597.............and so on.Note: In the above series we have omitted even terms from the general fibonacci sequence. Examples: Input: N = 3 Output: 3

Sum of Fibonacci Numbers in a range

Given a range [l, r], the task is to find the sum fib(l) + fib(l + 1) + fib(l + 2) + ..... + fib(r) where fib(n) is the nth Fibonacci number. Examples: Input: l = 2, r = 5 Output: 11 fib(2) + fib(3) + fib(4) + fib(5) = 1 + 2 + 3 + 5 = 11 Input: l = 4, r = 8 Output: 50 Naive approach: Simply calculat

Find the previous fibonacci number

Given a Fibonacci number N, the task is to find the previous Fibonacci number.Examples: Input: N = 8 Output: 5 5 is the previous fibonacci number before 8.Input: N = 5 Output: 3 Approach: The ratio of two adjacent numbers in the Fibonacci series rapidly approaches ((1 + sqrt(5)) / 2). So if N is div

Program to find last digit of n'th Fibonacci Number

Given a number 'n', write a function that prints the last digit of n'th ('n' can also be a large number) Fibonacci number. Examples : Input : n = 0 Output : 0 Input: n = 2 Output : 1 Input : n = 7 Output : 3 Recommended PracticeThe Nth FibonnaciTry It! Method 1 : (Naive Method) Simple approach is to

Sum of Fibonacci Numbers

Given a number positive number n, find value of f0 + f1 + f2 + .... + fn where fi indicates i'th Fibonacci number. Remember that f0 = 0, f1 = 1, f2 = 1, f3 = 2, f4 = 3, f5 = 5, ... Examples : Input : n = 3Output : 4Explanation : 0 + 1 + 1 + 2 = 4 Input : n = 4Output : 7Explanation : 0 + 1 + 1 + 2 +

Non Fibonacci Numbers

Given a positive integer n, the task is to print the nth non-Fibonacci number. The Fibonacci numbers are defined as: Fib(0) = 0Fib(1) = 1for n >1, Fib(n) = Fib(n-1) + Fib(n-2)First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, â€¦â€¦.. Examples: Input : n = 2Output : 6Input

Nth XOR Fibonacci number

Given three integers a, b and N where a and b are the first two terms of the XOR Fibonacci series and the task is to find the Nth term. The Nth term of the XOR Fibonacci series is defined as F(N) = F(N - 1) ^ F(N - 2) where ^ is the bitwise XOR.Examples: Input: a = 1, b = 2, N = 5 Output: 3 F(0) = 1

Prime number in PL/SQL

Prerequisite â€“ PL/SQL introductionA prime number is a whole number greater than 1, which is only divisible by 1 and itself. First few prime numbers are : 2 3 5 7 11 13 17 19 23 â€¦..In PL/SQL code groups of commands are arranged within a block. A block group-related declarations or statements. In decl

Program for Perrin numbers

The Perrin numbers are the numbers in the following integer sequence. 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, 22, 29, 39 ... In mathematical terms, the sequence p(n) of Perrin numbers is defined by the recurrence relation P(n) = P(n-2) + P(n-3) for n > 2, with initial values P(0) = 3, P(1) = 0, P(2)

Program to find last two digits of Nth Fibonacci number

Given a number â€˜nâ€™, write a function that prints the last two digits of n-th (â€˜nâ€™ can also be a large number) Fibonacci number.Examples: Input : n = 65 Output : 65 Input : n = 365 Output : 65 Recommended: Please solve it on â€œPRACTICEâ€ first, before moving on to the solution. A simple solution is to