  Extensions of a set partition obtained by imposing bounds on the size of the
parts and the coloring of some of the elements are examined. Combinatorial
properties and the generating functions of some counting sequences associated
with these partitions are established. Connections with Riordan arrays are
presented.
