Fibonacci series

import java.util.Scanner;
class Fibonacci
{
//this will find  Fibonacci upto the maximum number given
void printSeries(int number)
{
int sum=0;
int a=1;
int b=1;
System.out.printf("%d%d",a,b);
while(sum<number)
{
sum=a+b;
System.out.print(sum);
b=a;
a=sum;
}
}
//this will find Fibonacci upto n terms
int fibrecursion(int number)
{
if(number==0||number==1)
return 1;
else
return fibrecursion(number-1)+fibrecursion(number-2);
}
}
class FibonacciTest
{
public static void main(String args[])
{
Fibonacci f1=new Fibonacci();
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
//f1.printSeries(n);
for(int i=0;i<n;i++)
{
int t=f1.fibrecursion(i);
System.out.println(t);
}
}
}