Abstract
Recently, Andrews introduced partition functions (n) and ${\bar{\mathcal{EO}}}$(n) where the function (n) denotes the number of partitions of n in which every even part is less than each odd part and the function ${\bar{\mathcal{EO}}}$(n) denotes the number of partitions enumerated by (n) in which only the largest even part appears an odd number of times. In this paper we obtain some congruences modulo 2, 4, 10 and 20 for the partition function ${\bar{\mathcal{EO}}}$(n). We give a simple proof of the first Ramanujan-type congruences ${\bar{\mathcal{EO}}}$ (10n + 8) ≡ 0 (mod 5) given by Andrews.