Fibonacci数列

 

public class Fibonacci {
public static void main(String[] args) {
// TODO 自动生成的方法存根
int arr[] = new int[35];         
arr[0] = arr[1] = 1;         
for (int i = 2; i < arr.length; i++) {             
arr[i] = arr[i - 1] + arr[i - 2];                  
}                    
System.out.println("The Fibonacci sequence before "          
+ "the 20 items are as follows:");         
for (int i = 0; i <20; i++) {                 
System.out.print("n"+(i+1)+"="+arr[i] + "\t");                
if ((i+1) % 5 == 0)              
System.out.println();        
}         
int i=0;        
for(i=0;i<arr.length;i++) {        
if(arr[i]==2178309)            
System.out.println("2178309 is Fibonacci n"+(i+1)+" num");        
if(i>=arr.length)       
System.out.println("2178309 is not Fibonacci num!");        
} 
}
}