  We consider Dyck paths having height at most two with some constraints on the
number of consecutive valleys at height one which must be followed by a
suitable number of valleys at height zero. We prove that they are enumerated by
so-called Q-bonacci numbers (recently introduced by Kirgizov) which generalize
the classical q-bonacci numbers in the case where q is a positive rational.
