Congruences modulo powers of 3 for generalized Frobenius partitions with six colors

2016 ◽  
Author(s):  
Chao Gu ◽  
Liuquan Wang ◽  
Ernest X. W. Xia
2011 ◽  
Vol 311 (17) ◽  
pp. 1892-1902 ◽  
Author(s):  
Nayandeep Deka Baruah ◽  
Bipul Kumar Sarmah

2019 ◽  
Vol 15 (06) ◽  
pp. 1173-1181
Author(s):  
Su-Ping Cui ◽  
Nancy S. S. Gu

A generalized Frobenius partition of [Formula: see text] with [Formula: see text] colors is a two-rowed array [Formula: see text] where [Formula: see text], and the integer entries are taken from [Formula: see text] distinct copies of the non-negative integers distinguished by color, and the rows are ordered first by size and then by color with no two consecutive like entries in any row. Let [Formula: see text] denote the number of this kind of partitions of [Formula: see text] with [Formula: see text] colors. In this paper, we establish some congruences modulo powers of 2 for [Formula: see text].


2014 ◽  
Vol 10 (03) ◽  
pp. 637-639 ◽  
Author(s):  
BERNARD L. S. LIN

In this brief note, we prove one unexpected Ramanujan type congruence modulo 7 for the number cϕ4(n) of generalized Frobenius partitions of n with four colors.


1993 ◽  
Vol 16 (2) ◽  
pp. 413-415 ◽  
Author(s):  
James Sellers

The goal of this paper is to discuss congruences involving the functioncϕm¯(n), which denotes the number of generalized Frobenius partitions ofnwithmcolors whose order ismunder cyclic permutation of themcolors.


Sign in / Sign up

Export Citation Format

Share Document