Numbers which are not the sum of distinct squares: Difference between revisions

m
(Added Uiua solution)
 
Line 1,214:
 
=={{header|Uiua}}==
The Wren solution gives a little more justification for my guessassumption...
<syntaxhighlight lang="Uiua">
N ← 16 # by inspection
# all sums of the first N squares, sorted and deduped
◴⊏⊸⍏≡⊏⊸⍏◴≡(/+▽)⊙¤⋯⇡÷2ⁿN2×⋯⇡÷2ⁿ⟜(2×.↘1⇡N↘1⇡)N
# find missing numbers
▽¬°⊚:⇡⊡¯1.
# After 128 the next thousand900 can all be generated, so assume that's it done.
# ⟜⧻▽≤128.
</syntaxhighlight>
{{out}}
170

edits