public Problem114(){
		int n = 50;
		long[] a = new long[n+1];
		a[0] = a[1] = a[2] = 1;
		for(int i = 3; i <= n; i++){
			a[i] = a[i-1];//black first block
			for(int j = 3; 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]);
		}
	}