Let X be a finite sequence of length m≥1 in Z/nZ. The \textit{derived sequence} ∂X of X is the sequence of length m−1 obtained by pairwise adding consecutive terms of X. The collection of iterated derived sequences of X, until length 1 is reached, determines a triangle, the \textit{Steinhaus triangle ΔX generated by the sequence X}. We say that X is \textit{balanced} if its Steinhaus triangle ΔX contains each element of Z/nZ with the same multiplicity. An obvious necessary condition for m to be the length of a balanced sequence in Z/nZ is that n divides the binomial coefficient (m+12). It is an open problem to determine whether this condition on m is also sufficient. This problem was posed by Hugo Steinhaus in 1963 for n=2 and generalized by John C. Molluzzo in 1976 for n≥3. So far, only the case n=2 has been solved, by Heiko Harborth in 1972. In this paper, we answer positively Molluzzo's problem in the case n=3k for all k≥1. Moreover, for every odd integer n≥3, we construct infinitely many balanced sequences in Z/nZ. This is achieved by analysing the Steinhaus triangles generated by arithmetic progressions. In contrast, for any n even with n≥4, it is not known whether there exist infinitely many balanced sequences in Z/nZ. As for arithmetic progressions, still for n even, we show that they are never balanced, except for exactly 8 cases occurring at n=2 and n=6.