Congruences for overpartitions with restricted odd differences

In a recent work, Bringmann, Dousse, Lovejoy, and Mahlburg defined the function t¯(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{t}(n)$$\end{document} to be the number of overpartitions of weight n where (i) the difference between two successive parts may be odd only if the larger part is overlined and (ii) if the smallest part is odd, then it is overlined. In their work, they proved that t¯(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{t}(n)$$\end{document} satisfies an elegant congruence modulo 3, namely, for n≥1,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 1,$$\end{document}[graphic not available: see fulltext]In this work, using elementary tools for manipulating generating functions, we prove that t¯\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{t}$$\end{document} satisfies a corresponding parity result. We prove that, for all n≥1,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 1,$$\end{document}t¯(2n)≡1(mod2)ifn=(3k+1)2for some integerk,0(mod2)otherwise.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \overline{t}(2n) \equiv {\left\{ \begin{array}{ll} 1 \pmod {2} &{} \text{ if } n =(3k + 1)^2 \text { for some integer } k, \\ 0 \pmod {2} &{} \text{ otherwise. } \end{array}\right. } \end{aligned}$$\end{document}We also provide a truly elementary proof of the mod 3 characterization of Bringmann et al., as well as a number of additional congruences satisfied by t¯(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{t}(n)$$\end{document} for various moduli.