public Problem115(){
		int n = 200;
		int m = 50;
		long[] a = new long[n+1];
		for(int i = 0; i < m; i++){
			a[i] = 1;
		}
		for(int i = m; i <= n; i++){
			a[i] = a[i-1];//black first block
			for(int j = m; j < i; j++){//size of red block to start with
				a[i] += a[i-j-1];
			}
			a[i]++;//full red
			System.out.println(i + " " + a[i]);
		}
	}