Forbidden numbers: Difference between revisions

{{libheader|Wren-fmt}}

This uses a sieve to filter out those numbers which are the sums of one, two or three squares. Works but very slow (c. 52 seconds).

 

var forbidden = Fn.new { |limit, countOnly|

===Version 2===

This is a translation of the formula-based Python code in the OEIS link which at around 1.1 seconds is almost 50 times faster than Version 1 and is also about 3 times faster than the PARI code in that link.

 

var isForbidden = Fn.new { |n|