Fibonacci series using recursion?

#include    
int fib(int n)
{
   if (n <= 1)
      return n;
      else
        return fib(n-1) + fib(n-2);   
}
main()
{    
    int n,i;    
    printf("Enter the number of elements: n");    
    scanf("%d",&n);    
    printf("Fibonacci Series: n");
    for(i=0;i<n;i++)    
    printf("%d  ", fib(i));
 }