[math-fun] re one-to-one relation (odd partitions) <-> (non-repeat partitions)

Answer: (from Hardy and Wright) given n = l1 * 1 + l2 * 3 + l3 * 5 + l7 * 7 + ..., a ptn into odd parts, write each li in binary, e.g. li = 2^a1 + 2^a2 + 2^a3 + ... where the aj's are all different then expand n = (2^a1 * 1 + ...)*1 + ... by removing the brackets and we get a partition into distinct parts NJAS