@ConorO'Brien @ETHproductions @quartata
CMC: Input is a non-negative, zero-indexed integer, n, always 10,000,000 or less.
Output is an integer, calculated by doing: { Fibonnaci (n) } + { sum of prime factors of "n", with multiplicity } + { n + n }
Use the highest precision that ensures a good amount of golfing and accuracy. Arbitrary precision is not necessary,
Test case: Input is 1000, output is:
(4346655768693745643568852767504062580256466051737178040248172908953655541794905189040387984007925516929592259308032263477520968962323987332247116164299644090653318793829896964992851600370447…