Infinite Families of Congruences for Partition Functions e ®(n) and e ®e(n)

In 2018, Andrews introduced the partition functions e & REG;(n) and e & REG;(n). The first of these denotes the number of partitions of n in which every even part is less than each odd part, and the second counts the number of partitions enumerated by the first in which only the largest even part appears an odd number of times. In 2021, Pore and Fathima introduced a new partition function e & REG;e(n) which counts the number of partitions of n which are enumerated by e & REG;(n) together with the partitions enumerated by e & REG;(n) where all parts are odd and the number of parts is even. They also proved some particular congruences for e & REG;(n) and e & REG;e(n). In this paper, we establish infinitely many families of congruences modulo 2, 4, 5 and 8 for e & REG;(n) and modulo 4 for e & REG;e(n). For (-3) example, if p > 5 is a prime with Legendre symbol = -1, then for all integers n > 0 p and & alpha; > 0, we have ( \J 8 & BULL;p2 & alpha;+1 (pn + j) + 19 & BULL; p2 & alpha;+2 - 1 e & REG; = 0 (mod 8); 1 < j < (p - 1). 3