Can calculate count of odd integer partitions

PartitionCounter.java

public class PartitionCounter {
    public static void main(String[] args) {

//        System.out.print("[");
//        for (int k = 0; k < 201; k++) {
//            System.out.print(count(k) + (k != 200 ? ", " : ""));
//        }
//        System.out.print("]");
        System.out.println("11: " + count(11));
    }

    private static int count(int x) {
        if (x < 3) {
            return 0;
        }

        int f[] = new int[x + 1];
        f[0] = 1;
        f[1] = 1;

        for (int n = 2; n <= x; n++) {
            for (int k = x; k > n - 1; k--) {
                f[k] += f[k - n];
            }
        }

        return f[x] - 1;
    }
}