We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr's algorithm to a general summation framework by which additional types of summand expressions can be handled. Our treatment of unspecified sequences can be seen as a first illustrative application of this approach. Key words: Combinatorial Identities, Symbolic Summation, Difference Fields