gistfile1.js

function factorial(n) {
    if(n === 0) {
        return 1;
    }
    return n * factorial(n - 1);
}

function combination_formula(n, r) {
    var nfact = factorial(n);
    var rfact = factorial(r);

    return nfact / (rfact * factorial(n - r));
}

function find_sets(kn, k) {
    if(kn % k != 0) {
        console.log("kn " + kn + " does not evenly divide into k " + k + ", please pick other numbers");

    }
    if((kn - k) === 0) {
        return 1;
    }
    return combination_formula(kn, k) * find_sets(kn - k, k);
}

function main() {
    console.log("In main");
    for(var k = 2; k <= 4; k++) {
        for(var n = 1; n <= 3; n++) {
            var kn = n * k;
            var sets = find_sets(kn, k);
            console.log("For " + kn + " bosses and " + k + " sets there are " + sets + " combinations");
        }
    }
}

main();