Combinatorics of tenth-order mock theta functions

Combinatorics of some fifth and sixth order mock theta functions

“…In addition to ordinary partitions, some authors have also studied mock theta functions in terms of (n + t)-color partitions, generalized Frobenius partitions and lattice paths. For a detailed study reader can refer to ([2], [3] [6], [7], [23], [24], [25], [26], [27]). In [5], Agarwal and Bressoud introduced the idea of interpreting basic hypergeometric series with lattice paths.…”

“…Iterating (23) n times and considering the fact that τ 0 (q) = 1, we find that τ n (q) = q n (q; q) n (q; q 2 ) n , n ≥ 0.…”