Revision as of 17:31, 11 March 2023 (view source) Aerobar (talk \| contribs) (Frugal version) ← Older edit		Revision as of 18:43, 11 March 2023 (view source) Aerobar (talk \| contribs) m (→‎Frugal version) Newer edit →
Line 3,282: ===Frugal version=== Based on Mike Stay's formula, this program does not need recursion or storage of n/2 previous terms, and is faster. Since <code>fusc(2^n)=1</code> and <code>fusc(2^n+1)=n+1</code>, this formula can seriously improve ~~the calculation~~speed for big values of n, as the iteration ~~can~~could start at <code>2^floor(log2(n))</code> instead of 12. {\| class="wikitable" ! RPL code

Fusc sequence (view source)