Partitions into distinct parts

Given a non-negative integer n (0 <= n <= 60), return the number of ways to write n as a sum of DISTINCT positive integers, where order does not matter. For example n = 6 has 4 such partitions: 6; 1+5; 2+4; 1+2+3. By convention n = 0 has exactly one partition (the empty sum).