Don't be greedy! Difference between number of squares needed to sum to n using the greedy algorithm and using the best such sum.
A062535
Don't be greedy! Difference between number of squares needed to sum to n using the greedy algorithm and using the best such sum.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =0a(11) =1a(12) =0a(13) =0a(14) =0a(15) =0a(16) =0a(17) =1a(18) =1a(19) =0a(20) =0a(21) =1a(22) =1a(23) =0a(24) =0a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0
External references
- oeis: A062535