Dividing the number of different positive integer n divided into a series of positive integers and, seeking a positive integer

The positive integer n // divided into a series of positive and integer, a different number of integer division is seeking 
// represents integer division of n, m represents an integer of maximum division 
function Q (n, m) { 
    IF (n <. 1 m || <. 1) { 
        return 0; 
    } the else IF (n-m || === ===. 1. 1) { 
        return. 1; 
    } the else IF (n-<m) { 
        return Q (n-, n-) 
    } the else IF (=== n-m) { 
        return Q (n-,. 1-m) + 1'd 
    } the else { 
        return Q (n-,. 1-m) + Q (nm, m) 
    } 
} 
// example: positive integer 6 there are 11 dividing 
console.log (q (6,6));