Factor-perfect numbers: Difference between revisions
m
add more refs
m (add more refs) |
|||
Line 1:
{{draft task}}
Consider the list of factors (divisors) of an integer, such as 12. The factors of 12 are [1, 2, 3, 4, 6, 12]. Consider all sorted sequences of the factors of n such that each succeeding number in such a
we have the factors (divisors) [1, 2, 3, 6]. The 3 unique lists of sequential multiples starting with 1 and ending with 6 that can be derived from these factors are [1, 6], [1, 2, 6], and [1, 3, 6].
Line 32:
; see also:
[https://oeis.org/A163272 OEIS A163272]
[https://oeis.org/A074206 OEIS A074206]
[[https://doi.org/10.1016/j.jnt.2006.10.003 On the maximal order of numbers in the “factorisatio numerorum” problem]]
[[https://www.jstor.org/stable/1968777?origin=crossref On Some Asymptotic Formulas in The Theory of The "Factorisatio Numerorum"]]
[[wp:Enumerative_combinatorics|Wikipedia: Enumerative Combinatorics]]
<br /><br /><br />
| |||