bitburners waystosum

inputData = 40;

let i, j, k, l;
let ways = [];

for(i = 0; i < inputData; i++){
    ways[i] = 0;

    if (!i){
        ways[0] = 1;
    } else {

        big_loop:{
            for(j = 1; true; j++){
                for(k = 1; k > -2; k -= 2){
                    l = (j*k) * (3*j*k-1) / 2;
                    if (l > i){
                        break big_loop;
                    } else if (j & 1){
                        ways[i] = ways[i] + ways[i-l];
                    } else {
                        ways[i] = ways[i] - ways[i-l];
                    }
                }
            }
        }
    }
}

console.info(ways[inputData]-1);