Downloads provided by UsageCounts
Let $ \overline{PT}_o(n)$ denote the number of overpartition triples of a positive integer $n$ into odd parts. In this paper, we prove some infinite families of congruences modulo small powers of 2 and 3 for $ \overline{PT}_o(n)$. For example, for any $\alpha\geq0$ and $1\leq r\leq p-1$, we prove that$$\overline{PT}_o\Big(8\cdot p^{2\alpha+1}(pn+r)+3\cdot p^{2\alpha+2}\Big )\equiv 0 \pmod{16}.$$
Partitions; congruences and congruential restrictions, partitions, congruences, dissections, overpartitions
Partitions; congruences and congruential restrictions, partitions, congruences, dissections, overpartitions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 4 | |
| downloads | 8 |

Views provided by UsageCounts
Downloads provided by UsageCounts