In Fortran functions and subroutines need to be explicitly declared as recursive, if they are to call themselves again, directly or indirectly. Thus, a recursive implementation of the Fibonacci series could look like this:
recursive function fibonacci(term) result(fibo)
integer, intent(in) :: te...