On the complexity of a family of k-context-free sequences

We introduce a large family of k-context-free sequences for which we give a polynomial upper bound on their complexity functions.