Not a sum of distinct squares
C_K_Yang czp001 liuguangxi a_forsteri Burloq Min_25 C3PO Philippe_57721 gerrob zilet sinan hervas lesnik7 clytorock nielkh
Public  04/07/17  5xp  Programming  27.8% 
It is known since Lagrange that every positive integer can be represented as the sum of integer squares, 4 integers being enough.
But, if we add the constraint that all squares must be distinct, some integers are not representable as such a sum.
This set is finite.
How many positive integers can not be represented by a sum of distinct squares, and what is their sum? (You are given that the largest one if less than 5000)
Answer format: Count,Sum
[My timing: 15 s]
But, if we add the constraint that all squares must be distinct, some integers are not representable as such a sum.
This set is finite.
How many positive integers can not be represented by a sum of distinct squares, and what is their sum? (You are given that the largest one if less than 5000)
Answer format: Count,Sum
[My timing: 15 s]
New Members
 WildChild 4d:9h
 andresporras 5d:14h
 maggch 1w:1d
 RoniZeng 1w:1d
 stiwar 1w:3d
Fresh Problems

Generalized ellipse 1 3d:18h
solved by 6 
Machin Like Formulae 1w:6d
solved by 2 
Kolakoski Sequence 2w:1d
solved by 1 
A big sum 2 2w:3d
solved by 6 
Broken DNA 2w:6d
solved by 8