Fibonacci series using recursion in c

#include <stdio.h>
#include <stdlib.h>

int main()
{
   
   int n,i;
   // Here n is number of terms in series.
   printf("Enter value of n\n");
   scanf("%d",&n);
   printf("Fibonacci series is\n");
   for(i=1;i<=n;i++){
        printf("%d  ",fib(i));
   }


}
int fib(int n){

    if(n==1||n==2){
        return (1);
    }
    else
        return (fib(n-1)+fib(n-2));

}