Find sequence of numbers which form specified sum

seqSumFinder.js

function checkNumSeq(sum, chunks) {
	var
		i,
		hchunks,
		chunk,
		out = [];
		
	if ( sum % chunks === 0 && chunks % 2 ) {

		chunk = sum / chunks;
		hchunks = (chunks - 1)/2; 
		out.push(chunk);

		for (i = 1; i <= hchunks; i += 1) {

			out.unshift(chunk - i);
			out.push(chunk + i);
		}

		console.log('Got it! ' + out.join(' + ') + ' = ' + sum)
	} else {

		console.log('No paticular solution for ' + sum);
	}
}