fibonacci series using recursion

#include<stdio.h>
#include<conio.h>
int Fibonacci(int);
int main(){
int k,n; 
long int i=0,j=1,f;
printf("Enter the range of the Fibonacci series: ");    scanf("%d",&n);
printf("Fibonacci Series: ");  
printf("%d %d ",0,1);
Fibonacci(n);
return 0;}
int Fibonacci(int n){
static long int a=0,b=1,sum;
if(n>0)
{
sum = a + b;
a =b;      
b = sum;       
printf("%ld ",sum);    
Fibonacci(n-1);
}
}


Sample output:
Enter the range of the Fibonacci series: 10Fibonacci Series: 0 1 1 2 3 5 8 13 21 34 55 89