Counting restricted colored base-3 partitions of (3^n - 3)/2 yields exactly the Euclid-Euler form 2^(n-1)(2^n - 1), so every even perfect number appears as such a partition count.
(2011), The On-Line Encyclopedia of Integer Sequences , http://oeis.org
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
dataset 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
dataset 1polarities
use dataset 1representative citing papers
citing papers explorer
-
Colored base-3 partitions, sequences of polynomials, and perfect numbers
Counting restricted colored base-3 partitions of (3^n - 3)/2 yields exactly the Euclid-Euler form 2^(n-1)(2^n - 1), so every even perfect number appears as such a partition count.