Lookup the value from an array of integers that sums equal to 21

I need a recursive function that receives an array of integers and output the combination of values that is equal to 21. Example of input array {5,6,10,11, 8,9, 2] should output {5,6,10}, {10,11}, {10,9,2}, {11,8,2}, {10,11,8,2} *the 11 could worth 1 or 11. That's all I need. It's very important to have the code in Delphi and I need a use of recursive function (to be more efficient if I use a large array).