Factor-perfect numbers: Difference between revisions
Content added Content deleted
m (→{{header|J}}: cleaner) |
(Specify a key feature of F) |
||
| Line 27: | Line 27: | ||
: <math display="block"> F(n) = \sum_{k} F(\frac{n}{a_k}) + 1 </math> |
: <math display="block"> F(n) = \sum_{k} F(\frac{n}{a_k}) + 1 </math> |
||
where a is a list of the factors of n, including n, but excluding 1. F(n) is here the same as a function for calculating the number of different factorizations according to the second definition above. |
where a is a list of the factors of n, including n, but excluding 1. F(n) is here the same as a function for calculating the number of different factorizations according to the second definition above except that F(1)=0 (where the number of factorizations of 1 must be 1 for it to be included in the sequence of factor-perfect numbers). |
||
<br /> |
<br /> |
||