The main result of this paper is a combinatorial characterization of Magidor-generic sequences. Using this characterization, I show that the critical sequences of certain iterations are Magidor-generic over the target model. I then employ these results in order to analyze which other Magidor sequences exist in a Magidor extension. One result in this direction is that if we temporarily identify Magidor sequences with their ranges, then Magidor sequences are maximal, in the sense that they contain any other Magidor sequence that is present in their forcing extension, even if the other sequence is generic for a different Magidor forcing. A stronger result holds if both sequences come from the same forcing: I show that a Magidor sequence is almost unique in its forcing extension, in the sense that any other sequence generic for the same forcing which is present in the same forcing extension coincides with the original sequence at all but finitely many coordinates, and at all limit coordinates. Further, I ask the question: If d ε V[c], where c and d are Magidor-generic over V, then which Magidor forcing can d be generic for? It turns out that it must essentially be a collapsed version of the Magidor forcing for which c was generic. I treat several related questions as well. Finally, I introduce a special case of Magidor forcing which I call minimal Magidor forcing. This approach simplifies the forcing, and I prove that it doesn’t restrict the class of possible Magidor sequences. That is, if c is generic for a Magidor forcing over V, then it is generic for a minimal Magidor forcing over V.