Acta Math Vietnam

DOI 10.1007/s40306-017-0206-3

Congruences of − Regular Partition Triples

for  ∈ {2, 3, 4, 5}

Nipen Saikia1 · Chayanika Boruah1

Received: 25 April 2016 / Revised: 10 January 2017 / Accepted: 16 January 2017

© Institute of Mathematics, Vietnam Academy of Science and Technology (VAST) and Springer
Science+Business Media Singapore 2017

Abstract For any positive integer , let B (n) denotes the number of -regular partition
triples of a positive integer n. By employing q−series identities, we prove infinite family
of arithmetic identities and congruences modulo 4 for B2 (n), modulo 2 and 9 for B3 (n),
modulo 2 for B4 (n) and modulo 2 and 5 for B5 (n).

Keywords -regular partition · Partition triples · Partition congruence · q−series

identities · Ramanujan’s theta-functions

Mathematics Subject Classification (2010) 11P83 · 05A15 · 05A17

1 Introduction

A partition of a positive integer n is a non-increasing sequence of positive integers, called

parts, whose sum equals n. A partition k-tuple (λ1 , λ2 , · · · λk ) of a positive integer n is a k-
tuple of partitions λ1 , λ2 , · · · , λk such that the sum of all the parts equals n. If k = 3 then
the 3−tuple (λ1 , λ2 , λ3 ) is called a partition triple of n.
For any positive integer , -regular partition of a positive integer n is a partition of n
such that none of its part is divisible by . If b (n) denotes the number of -regular partition
of n, then
∞
(q  ; q  )∞
b (n)q n = , (1)
(q; q)∞
n=0

 Nipen Saikia
nipennak@yahoo.com
Chayanika Boruah
cboruah123@gmail.com

1 Department of Mathematics, Rajiv Gandhi University, Rono Hills, Doimukh,

791112, Arunachal Pradesh, India
 N. Saikia, C. Boruah

where
∞

(a; q)∞ = (1 − aq n ). (2)
n=0

The arithmetic properties of -regular partitions have been studied by many authors, for
example see [2, 3, 6–11, 14–16] and references there in.
A partition triple (λ1 , λ2 , λ3 ) of a positive integer n is called −regular partition triple if
none of λi , i = 1, 2, and 3, is divisible by . If B (n) denotes the the number of - regular
partition triples of a positive integer n then B (n) is defined as
∞
 (q  ; q  )3∞
B (n)q n = . (3)
(q; q)3∞
n=0

The partition triples of different partition functions have received attentions in recent times.
Wang [13] established several infinite families of arithmetic identities and congruences
for partition triples with 3-cores. Wang [12] also proved infinite families of arithmetic
properties and congruences for overpartition triples.
Motivated by the work done in [12, 13], in this paper we study arithmetic properties
of -regular partition triples for  = 2, 3, 4, and 5 and prove infinite family of arithmetic
identities and congruences for B (n) by using q−series identities.
In Section 3, we prove arithmetic identities and congruences for 2-regular partition triples
modulo 4. In Section 4, we prove arithmetic identities and congruences for 3-regular par-
tition triples modulo 2 and 9. In Section 5, we prove arithmetic identities and congruences
for 4-regular partition triples modulo 2. In Section 6, we prove an arithmetic identity for
5-regular partition triples modulo 2 and 5. Section 2 is devoted to record some preliminary
results.

2 Preliminaries

Ramanujan’s general theta-function f (a, b) is defined by

∞

f (a, b) = a n(n+1)/2 bn(n−1)/2 , |ab| < 1. (4)
n=−∞

Two useful cases of f (a, b) [5, p. 36, Entry 22 (iii)] are

∞

f (−q) := f (−q, −q 2 ) = (−1)n q n(3n+1)/2 = (q; q)∞ (5)
n=−∞

and
∞
 (q 2 ; q 2 )2∞
ψ(q) := f (q, q 3 ) = q n(n+1)/2 = . (6)
(q; q)∞
n=0

Lemma 2.1 For any prime p, we have

p
(q p ; q p )∞ ≡ (q; q)∞ (mod p).

Proof Follows easily from binomial theorem.

Congruences of − Regular Partition Triples for  ∈ {2, 3, 4, 5}

Lemma 2.2 [1, Lemma 1.4] For any prime p, we have

p2 p
(q; q)∞ ≡ (q p ; q p )∞ (mod p 2 ).

Lemma 2.3 [17, p. 382, Eqn. (3.38)] We have

(q 3 ; q 3 )∞ (q 4 ; q 4 )6∞ (q 6 ; q 6 )3∞ (q 4 ; q 4 )2∞ (q 6 ; q 6 )∞ (q 12 ; q 12 )2∞
= + 3q . (7)
(q; q)3∞ (q 2 ; q 2 )9∞ (q 12 ; q 12 )2∞ (q 2 ; q 2 )7∞

Lemma 2.4 [7, Theorem 2.2] For any prime p ≥ 5, we have

p−1

2  
2 +k)/2 3p 2 +(6k+1)p 3p 2 −(6k+1)p
f (−q) := (q; q)∞ = (−1)k q (3k f −q 2 , −q 2

±p−1
k=− p−1
2 k = 6
±p−1 p 2 −1 2
+(−1) 6 q 24 f (−q p ), (8)
⎧
⎪ p−1
±p − 1 ⎨ , if p ≡ 1 (mod 6),
where := −p6 − 1
6 ⎪
⎩ , if p ≡ −1 (mod 6).
6
p−1 p−1 ±p − 1 3k 2 + k p2 − 1
Furthermore, if − ≤ k ≤ and k = , then ≡
2 2 2 2 24
(mod p).

Lemma 2.5 [7, Theorem 2.1] For any odd prime p, we have
p−3

2
k 2 +k p 2 +(2k+1)p p 2 −(2k+1)p p 2 −1 2
ψ(q) = q 2 f (q 2 ,q 2 )+q 8 ψ(q p ), (9)
k=0

where
k2 + k p2 − 1 p−3
≡ (mod p) for, 0 ≤ k ≤ .
2 8 2
Lemma 2.6 [5, p. 267, Eqn. (11.6)] We have
(q; q)6∞
= F −5 (q) − 11q − q 2 F 5 (q), (10)
(q 5 ; q 5 )6∞
where F (q) := q −1/5 R(q) and R(q) is the Rogers-Ramanujan continued fraction defined
by
q 1/5 q q 2 q 3
R(q) := , |q| < 1
1 + 1 + 1 + 1 +···

Lemma 2.7 [4, p. 648, Eqn. (2.2)] For any integer k ≥ 1, we have
32k − 1
p6 32k n + = 32k p6 (n), (11)
4
where
∞

p6 (n)q n = (q; q)6∞ . (12)
n=0
 N. Saikia, C. Boruah

Lemma 2.8 [9, Theorem 1] We have

(q 5 ; q 5 )∞ (q 8 ; q 8 )∞ (q 20 ; q 20 )2 (q 4 ; q 4 )3∞ (q 10 ; q 10 )∞ (q 40 ; q 40 )∞
= 2 2 2 40 40 ∞ + q .
(q; q)∞ (q ; q )∞ (q ; q )∞ (q 2 ; q 2 )3∞ (q 8 ; q 8 )∞ (q 20 ; q 20 )∞

3 Congruences for 2-Regular Partition Triples Modulo 4

 
−2
Theorem 3.1 If p ≥ 5 is a prime such that = −1, then for any non-negative integer
p
α,we have
∞
 (p 2α − 1)
B2 p 2α n + q n ≡ (q; q)∞ (q 2 ; q 2 )∞ (mod 4), (13)
8
n=0
·
where, here and throughout the paper denotes the Legendre symbol.
·
Proof Setting  = 2 in (3), we obtain
∞
 (q 2 ; q 2 )3∞
B2 (n)q n = , (14)
(q; q)3∞
n=0
Using Lemma 2.2 in (14), we have
∞

B2 (n)q n ≡ (q; q)∞ (q 2 ; q 2 )∞ (mod 4), (15)
n=0
which is the α = 0 case of (13). Suppose that (13) holds for α ≥ 0. Employing Lemma 2.4
in (15), we obtain
∞
  
(p2α − 1)
B2 p 2α n + qn (16)
8
n=0
⎡ ⎤
⎢ ⎥
⎢ p−1
  ⎥
⎢ 2
3k 2 +k 3p 2 +(6k+1)p 3p 2 −(6k+1)p ±p−1 p 2 −1 2 ⎥
≡ ⎢
⎢ (−1) q 2 f −q
k 2 , −q 2 + (−1) 6 q 24 f (−q )⎥
p
⎥
⎢ ⎥
⎣ k = − p−1
2
⎦
±p−1
k = 6
⎡ ⎤
⎢ ⎥
⎢ p−1
   ⎥
⎢ 2
3m2 +m 3p 2 +(6m+1)p 3p 2 −(6m+1)p ±p−1 p 2 −1 2 ⎥
×⎢
⎢ (−1) m
q 2· 2 f −q 2· 2 ,−q 2· 2 +(−1) 6 q 2· 24 f (−q 2p
) ⎥
⎥ (mod 4).
⎢ ⎥
⎣ m = − p−1
2
⎦
±p−1
m = 6

Consider the congruence

3k 2 + k 3m2 + m 3p 2 − 3
+2· ≡ (mod p), (17)
2 2 24
where −(p − 1)/2 ≤ k, m ≤ (p − 1)/2. The congruence (17) is equivalent to
(6k + 1)2 + 2(6m + 1)2 ≡ 0 (mod p). (18)
 
−2 ±p − 1
For = −1, the congruence (18) holds if and only if m = k = .
p 6
Congruences of − Regular Partition Triples for  ∈ {2, 3, 4, 5}

2 −1)/8
Extracting the terms containing q pn+(p from both side of (17), dividing by
q −1)/8 and replacing q p by q, we obtain
(p 2

∞
 p 2α+2 − 1
B2 p 2α+1 n + q n ≡ (q p ; q p )∞ (q 2p ; q 2p )∞ (mod 4). (19)
8
n=0

Again, extracting terms involving q pn from both sides of (19) and replacing q p by q, we
obtain
∞
 p 2(α+1) − 1
B2 p 2(α+1) n + q n ≡ (q; q)∞ (q 2 ; q 2 )∞ (mod 4), (20)
8
n=0

which is the case α + 1 of (13). Hence, the proof is complete.

 
−2
Theorem 3.2 If p ≥ 5 is a prime such that = −1, and 1 ≤ j ≤ p − 1, then for any
p
non-negative integers α and n, we have

p 2(α+1) − 1
B2 p 2α+1 (pn + j ) + ≡0 (mod 4). (21)
8

Proof Equating the coefficients of q pn+j , for 1 ≤ j ≤ p − 1, from both sides of (19), we
arrive at the desired result.

4 Congruences for 3-Regular Partition Triples Modulo 2 and 9

Theorem 4.1 For any odd prime p and any non-negative integers α and n, we have
∞
 p 2α − 1
B3 2p 2α n + q n ≡ ψ(q) (mod 2). (22)
4
n=0

Proof Setting  = 3 in (3), we obtain

∞
 (q 3 ; q 3 )3∞
B3 (n)q n = . (23)
(q; q)3∞
n=0

Applying Lemma 2.1 in (23), we obtain

∞
 (q 3 ; q 3 )∞
B3 (n)q n ≡ (q 6 ; q 6 )∞ (mod 2). (24)
(q; q)3∞
n=0

Using Lemma 2.3 in (24), extracting terms involving q 2n and replacing q 2 by q, we obtain
∞

B3 (2n)q n ≡ (q; q)3∞ (mod 2). (25)
n=0

Using Lemma 2.1 in (6), we find that

ψ(q) ≡ (q; q)3∞ (mod 2). (26)
 N. Saikia, C. Boruah

Employing (26) in (25), we obtain

∞

B3 (2n)q n ≡ ψ(q) (mod 2), (27)
n=0

which is the α = 0 case of (22). Now, suppose (22) is true for some α ≥ 0. Employing
Lemma 2.5 in (22), we obtain
p−3
∞
 
p 2α − 1 2
k 2 +k p 2 +(2k+1)p p 2 −(2k+1)p
B3 2p n +
2α
qn ≡ q 2 f (q 2 ,q 2 )
4
n=0 k=0
2 −1)/8 2
+q (p ψ(q p ) (mod 2). (28)

Extracting terms involving q pn+(p 2 −1)/8 from both sides of (28), dividing by q (p2 −1)/8 and
replacing q p by q, we obtain
∞
 p 2(α+1) − 1
B3 2p 2α+1 n + q n ≡ ψ(q p ) (mod 2). (29)
4
n=0

Again, extracting terms involving q pn from both sides of (29) and replacing q p by q, we
obtain
∞
 p 2(α+1) − 1
B3 2p 2(α+1) n + q n ≡ ψ(q) (mod 2), (30)
4
n=0

which is the α + 1 case of (22). Hence, the proof is complete.

Theorem 4.2 For any odd prime p and integers α ≥ 0 and 1 ≤ j ≤ p − 1, we have

p 2(α+1) − 1
B3 2p 2α+1 (pn + j ) + ≡0 (mod 2). (31)
4

Proof Equating the coefficients of q pn+j , for 1 ≤ j ≤ p − 1, from both sides of (29), we
arrive at the desired result.

Theorem 4.3 For any integer k ≥ 1, we have

32k − 1
B3 32k n + ≡0 (mod 9). (32)
4

Proof Using Lemma 2.2 in (23), we obtain

∞

B3 (n)q n ≡ (q; q)6∞ (mod 9). (33)
n=0

Using (12) in (33), we obtain

B3 (n) ≡ p6 (n) (mod 9). (34)

Employing (11) in (34), we arrive at the desired result.

Congruences of − Regular Partition Triples for  ∈ {2, 3, 4, 5}

5 Congruences for 4-Regular Partition Triples Modulo 2

 
−8
Theorem 5.1 If p ≥ 5 is a prime such that = −1, then for any non-negative integer
p
α,we have
∞
 9(p 2α − 1)
B4 p 2α n + q n ≡ (q; q)∞ (q 8 ; q 8 )∞ (mod 2). (35)
24
n=0

Proof Setting  = 4 in (3), we obtain

∞
 (q 4 ; q 4 )3∞
B4 (n)q n = , (36)
(q; q)3∞
n=0
Applying Lemma 2.1 in (36), we obtain
∞

B4 (n)q n ≡ (q; q)∞ (q 8 ; q 8 )∞ (mod 2), (37)
n=0

which is the α = 0 case of (35). Now, suppose that (35) is true for some α ≥ 0. Employing
Lemma 2.4 in (35), we obtain

∞
  
9(p2α − 1)
B4 p 2α n + qn (38)
24
n=0
⎡ ⎤
⎢ ⎥
⎢ p−1
  ⎥
⎢ 2 2 3p 2 +(6k+1)p 3p 2 −(6k+1)p ±p−1 p 2 −1 ⎥
⎢ k 3k 2+k p2 ⎥
≡⎢ (−1) q f −q 2 , −q 2 + (−1) 6 q 24 f (−q )⎥
⎢ ⎥
⎣ k = − p−1
2
⎦
±p−1
k = 6
⎡ ⎤
⎢ ⎥
⎢ p−1
  ⎥
⎢  2 2
m 8· 3m 2+m
2
8· 3p +(6m+1)p
2
8· 3p −(6m+1)p ±p−1 2
8· p 24−1
⎥
⎢
×⎢ (−1) q ×f −q 2 ,−q 2 +(−1) 6 q 8p 2 ⎥
f (−q )⎥ (mod 2).]
⎢ ⎥
⎣m = − p−1
2
⎦
±p−1
m = 6

Consider the congruence

3k 2 + k 3m2 + m 9p 2 − 9
+8· ≡ (mod p), (39)
2 2 24
where −(p − 1)/2 ≤ k, m ≤ (p − 1)/2. The congruence (39) is equivalent to
(6k + 1)2 + 8(6m + 1)2 ≡ 0 (mod p). (40)
 
−8 ±p − 1
For = −1, the congruence (40) holds if and only if m = k = . Extracting
p 6
the terms containing q pn+(9(p −1))/24 from both side of (39), dividing by q (9(p −1))/24 and
2 2

replacing q p by q, we obtain
∞
 9(p 2α+2 − 1)
B4 p 2α+1 n + q n ≡ (q p ; q p )∞ (q 8p ; q 8p )∞ (mod 2). (41)
24
n=0
 N. Saikia, C. Boruah

Again, extracting terms involving q pn from both sides of (41) and replacing q p by q, we
obtain
∞
9(p 2(α+1) − 1)
B4 p 2(α+1) n + q n ≡ (q; q)∞ (q 8 ; q 8 )∞ (mod 2), (42)
24
n=0
which is the case α + 1 of (35). Hence, the proof is complete.
 
−8
Theorem 5.2 If p ≥ 5 is a prime such that = −1 and 1 ≤ j ≤ p − 1, then for any
p
non-negative integers α and n, we have
9(p 2(α+1) − 1)
B4 p 2α+1 (pn + j ) + ≡0 (mod 2). (43)
24
Proof Equating the coefficients of q pn+j , for 1 ≤ j ≤ p − 1, from both sides of (41), we
arrive at the desired result.

6 Congruences for 5-Regular Partition Triples Modulo 2 and 5

Theorem 6.1 For any odd prime p and any non-negative integers α and n, we have
∞
 p 2α − 1
B5 4p 2α n + q n ≡ ψ(q) (mod 2). (44)
2
n=0
Proof Setting  = 5 in (3), we obtain
∞
 (q 5 ; q 5 )3∞
B5 (n)q n = , (45)
(q; q)3∞
n=0

Applying Lemma 2.8 in (45), we obtain

∞ 3
 (q 8 ; q 8 )∞ (q 20 ; q 20 )2∞ (q 4 ; q 4 )3∞ (q 10 ; q 10 )∞ (q 40 ; q 40 )∞
B5 (n)q n = +q .
(q ; q )∞ (q ; q )∞
2 2 2 40 40 (q 2 ; q 2 )3∞ (q 8 ; q 8 )∞ (q 20 ; q 20 )∞
n=0
(46)
Expanding the right hand side of (46), extracting the terms involving q 2n and replacing q 2
by q, we obtain
∞
 (q 4 ; q 4 )3∞ (q 10 ; q 10 )6∞ (q 2 ; q 2 )6∞ (q 5 ; q 5 )2∞ (q 20 ; q 20 )∞
B5 (2n)q n = + 3q . (47)
(q; q)6∞ (q 20 ; q 20 )3∞ (q; q)8∞ (q 4 ; q 4 )∞
n=0
Using Lemma 2.1 with p = 2 in (47), we obtain
∞

B5 (2n)q n ≡ (q 2 ; q 2 )3∞ + q(q 10 ; q 10 )3∞ (mod 2). (48)
n=0

Extracting the terms invloving q 2n from (48) and replacing q 2 by q, we obtain

∞

B5 (4n)q n ≡ (q; q)3∞ ≡ ψ(q) (mod 2), (49)
n=0
where we used (26) in the last step. This shows that (44) is true for the case α = 0.
Congruences of − Regular Partition Triples for  ∈ {2, 3, 4, 5}

Now, suppose (44) is true for some α ≥ 0. Employing Lemma 2.5 in (44), we obtain
p−3
∞
 
p 2α − 1 2
k 2 +k p 2 +(2k+1)p p 2 −(2k+1)p
B5 4p n +
2α
qn ≡ q 2 f (q 2 ,q 2 )
2
n=0 k=0
p 2 −1 2
+q 8 ψ(q p ) (mod 2). (50)
Extracting terms involving q pn+(p 2 −1)/8 from both sides of (50), dividing by q (p2 −1)/8 and
replacing q p by q, we obtain
∞
 p 2(α+1) − 1
B5 4p 2α+1 n + q n ≡ ψ(q p ) (mod 2). (51)
2
n=0
Again, extracting terms involving q pn from both sides of (51) and replacing q p by q, we
obtain
∞
 p 2(α+1) − 1
B5 2p 2(α+1) n + q n ≡ ψ(q) (mod 2), (52)
2
n=0
which is the α + 1 case of (44). Hence, the proof is complete.

Theorem 6.2 For any odd prime p and integers α ≥ 0 and 1 ≤ j ≤ p − 1, we have
p 2(α+1) − 1
B5 4p 2α+1 (pn + j ) + ≡0 (mod 2). (53)
2

Proof Equating the coefficients of q pn+j , for 1 ≤ j ≤ p − 1, from both sides of (51), we
arrive at the desired result.

Theorem 6.3 For any odd prime p and any non-negative integers α and n, we have
∞
 5p 2α − 1
B5 20p 2α n + q n ≡ ψ(q) (mod 2). (54)
2
n=0

Proof Extracting the terms invloving q 10n+1 from (48), dividing by q, and replacing q 10 by
q, we obtain
∞
B5 (20n + 2)q n ≡ (q; q)3∞ ≡ ψ(q) (mod 2), (55)
n=0
which is the α = 0 case of (54).
Now, suppose (54) is true for some α ≥ 0. Employing Lemma 2.5 in (54), we obtain
p−3
∞
 
5p 2α − 1 2
k 2 +k p 2 +(2k+1)p p 2 −(2k+1)p
B5 20p n +
2α
qn ≡ q 2 f (q 2 ,q 2 )
2
n=0 k=0
p 2 −1 2
+q 8 ψ(q p ) (mod 2). (56)
Extracting terms involving q pn+(p 2 −1)/8 from both sides of (56), dividing by q (p2 −1)/8 and
replacing q p by q, we obtain
∞
 5p 2(α+1) − 1
B5 20p 2α+1 n + q n ≡ ψ(q p ) (mod 2). (57)
2
n=0
 N. Saikia, C. Boruah

Again, extracting terms involving q pn from both sides of (57) and replacing q p by q, we
obtain
∞
5p 2(α+1) − 1
B5 20p 2(α+1) n + q n ≡ ψ(q) (mod 2), (58)
2
n=0
which is the α + 1 case of (54). Hence, the proof is complete.

Theorem 6.4 For any odd prime p and integers α ≥ 0 and 1 ≤ j ≤ p − 1, we have

5p 2(α+1) − 1
B5 20p 2α+1 (pn + j ) + ≡0 (mod 2). (59)
2

Proof Equating the coefficients of q pn+j , for 1 ≤ j ≤ p − 1, from both sides of (57), we
arrive at the desired result.

Theorem 6.5 For any positive integers n and α ≥ 0, we have

 
5α − 1
B5 5α n + ≡ (−1)α B5 (n) (mod 5). (60)
2

Proof Setting  = 5 in (3), we obtain

∞
 (q 5 ; q 5 )3∞
B5 (n)q n = . (61)
(q; q)3∞
n=0

Applying Lemma 2.1 in (61), we obtain

∞

B5 (n)q n ≡ (q; q)12
∞ (mod 5). (62)
n=0

Employing Lemma 2.6 in (62), we obtain

∞

−10
B5 (n) q n ≡ (q 5 ; q 5 )12
∞ F (q) + 119q 2 + q 4 F 10 (q) − 22qF −5 (q)
n=0

+22q 3 F 5 (q) (mod 5). (63)

Extracting the terms involving q 5n+2 , dividing by q 2 and replacing q 5 by q, we obtain

∞

B5 (5n + 2) q n ≡ (−1)(q; q)12
∞ (mod 5), (64)
n=0

Combining (62) and (64), we deduce that

B5 (5n + 2) ≡ (−1)B5 (n) (mod 5). (65)
Iterating (65) by replacing n by 5n + 2 and simplifying, we complete the proof.

Acknowledgments The first author (N. Saikia) is thankful to Council of Scientific and Industrial Research
of India for partially supporting the research work under the Research Scheme No. 25(0241)/15/EMR-II (F.
No. 25(5498)/15).
The authors thank anonymous referee for his/her valuable suggestions and comments.
Congruences of − Regular Partition Triples for  ∈ {2, 3, 4, 5}

References

1. Baruah, N.D., Ahmed, Z.: Congruences modulo p 2 and p 3 for k dots bracelet partitons with k = mp s.
J. Number Theory 151(5), 129–146 (2015)
2. Baruah, N.D., Ahmed, Z.: New congruences for −regular partitions for {5, 6, 7, 49}. Ramanujan J.
doi:10.1007/s11139-015-9752-2 (2016)
3. Baruah, N.D., Das, K.: Parity results for 7-regular and 23-regular partitions. Int. J. Number Theory II,
2221–2238 (2015)
4. Baruah, N.D., Sarmah, B.K.: Identities and congruences for the general partition and Ramanujan’s Tau
functions. Indian J. Pure Appl. Math. 44(5), 643–671 (2013)
5. Berndt, B.C.: Ramanujan’s notebooks part, vol. III. Springer, New York (1991)
6. Carlson, R., Webb, J.J.: Infinite families of congruences for k-regular partitions. Ramanujan J. 33, 329–
337 (2014)
7. Cui, S.P., Gu, N.S.S.: Arithmetic properties of - regular partitions. Adv. Appl. Math. 51, 507–523 (2013)
8. Dandurand, B., Penniston, D.: -divisibility of -regular partition functions. Ramanujan J. 19, 63–70
(2009)
9. Hirschhorn, M.D., Sellers, J.A.: Elementary proofs of parity results for 5-regular partitions. Bull. Aust.
Math. Soc. 81, 58–63 (2010)
10. Lin, B.L.S.: An infinite family of congruences modulo 3 for 13-regular bipartitions. Ramanujan J.
doi:10.1007/s11139-014-9610-7 (2014)
11. Penniston, D.: Arithmetic of -regular partition functions. Int. J. Number Theory 4, 295–302 (2008)
12. Wang, L.: Arithmetic properties of overpartition triples arXiv:1410.7898v2 [math.NT] 12 (2015)
13. Wang, L.: Arithmetic identities and congruences for partition triples with 3-cores. Int. J Number Theory.
doi:10.1142/S1793042116500627 (2015)
14. Webb, J.J.: Arithmetic of the 13-regular partition function modulo 3. Ramanujan J. 25, 49–56 (2011)
15. Xia, E.X.W., Yao, O.X.M.: Parity results for 9-regular partitions. Ramanujan J. 34, 109–117 (2014)
16. Xia, E.X.W., Yao, O.X.M.: A proof of Keith’s conjecture for 9-regular partitions modulo 3. Int. J.
Number Theory 10, 669–674 (2014)
17. Xia, E.X.W., Yao, O.X.M.: Analogues of Ramanujan’s partition identities. Ramanujan J. 31, 373–396
(2013)