The OP professed an interest to "make a more efficient program to compute the strict partitions," but as yet no one has addressed timing.
Block[{n = 61}, Join @@@ KeyValueMap[#1*(#*2^Range[Length[#] - 1, 0, -1] &@ IntegerDigits[#2, 2]) &] /@ Counts /@ IntegerPartitions[n, Infinity, Range[1, n, 2]] /. 0 -> Nothing (* zero counts for nothing *) ] // Length // AbsoluteTiming (* {0.15744, 12076} *)