On Colored Factorizations
Combinatorics
2020-08-25 v1
Abstract
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and non-distinct factorizations with at most and exactly l colors.
Cite
@article{arxiv.2008.09984,
title = {On Colored Factorizations},
author = {Jacob Sprittulla},
journal= {arXiv preprint arXiv:2008.09984},
year = {2020}
}
Comments
11 pages