factorion

This function calculates the factorion value for the specified input integer. A number is a 'factorion' if it equals the sum of the factorials of its digits in a given base.

A collection of toys to do things like generate Collatz and other interesting sequences, calculate a fraction which is a close approximation to some value (e.g., 22/7 or 355/113 for pi), and so on.

Carl Witthoft

FunWithNumbers

Fun with Fractions and Number Sequences

factorion function

<dl> <dt>x</dt>
<dd>The integer, or <code>bigz</code> integer, or character string representing an integer.</dd><dt>base</dt>
<dd>The the base of the input integer <code>x</code>. Bases 2 through 36 are supported. Default is 10.</dd><dt>findcycle</dt>
<dd>Logical value indicating whether or not to test for cyclic values. See Details for more information.</dd>
<dt>maxiter</dt>
<dd>A "safety switch" to avoid possible infinite loops, terminating the function prior to convergence. Only applicable when <code>findcycle</code> is TRUE.</dd></dl>

Arguments

Carl Witthoft, <a href="/link/carl%40witthoft.com?package=FunWithNumbers&version=1.2" data-mini-rdoc="FunWithNumbers::carl@witthoft.com">carl@witthoft.com</a>

Author

Find  Factorion Numbers. ~~ — factorion

<dl>

 <dt>x</dt>
<dd>The integer, or <code>bigz</code> integer, or character string representing an integer.</dd>

<dt>base</dt>
<dd>The the base of the input integer <code>x</code>. Bases 2 through 36 are supported. Default is 10.</dd>

<dt>findcycle</dt>
<dd>Logical value indicating whether or not to test for cyclic values. See Details for more information.</dd>


<dt>maxiter</dt>
<dd>A "safety switch" to avoid possible infinite loops, terminating the function prior to convergence. Only applicable when <code>findcycle</code> is TRUE.</dd>

</dl>

Carl Witthoft, <a href='mailto:carl@witthoft.com'>carl@witthoft.com</a>

factorion: Find Factorion Numbers. ~~

Description

Usage

Value

Arguments

Author

Details

References

Examples