We answer to questions about n-tuple of return time limit laws raised in [2]. By constructing rank-one systems with a 2-tuple different from (F, F ) along sequence of cylinders, we prove that the second return time limit law is not entirely determined by the first return time limit law. Matrix technique is developed in order to solve the combinatorial problem of 2-tuple return time laws. Thus, using a good implementation of a sequence of periodic systems in a rank-one system, examples of rank-one systems such that the 2-tuple return time limit laws along sequences of cylinders satisfiesF (1) =F (2) are given.