In Fibonacci series each number is the sum of 2 preceding ones starting from 0 and 1.

F(0) = 0, F(1) = 1,and F(n) = F(n-1)+F(n-2) for n>1

This is a companion discussion topic for the original entry at http://iq.opengenus.org/print-fibonacci-series-in-reverse-order/