Let a0,b0,c0 be the initial numbers on the blackboard, and ai,bi,ci be the numbers written on the blackboard after the i-th move; let S(a0,b0,c0) and S(ai,bi,ci) be the sums of these numbers, respectively. Then after the i+1-th move we obtain the following numbers
ai+1=aibi2+ci2,bi+1=bici2+ai2,ci+1=ciai2+bi2.
We have the lower estimate for S(ai+1,bi+1,ci+1):
S(ai+1,bi+1,ci+1)=aibi2+ci2+bici2+ai2+ciai2+bi2≥ai2bici+bi2ciai+ci2aibi==aibici+aibici+biciai+biciai+ciaibi+ciaibi==(aibici+ciaibi)+(aibici+biciai)+(ciaibi+biciai)==bi(aici+ciai)+ci(aibi+biai)+ai(cibi+bici)≥[βα+αβ≥2]≥≥2(ai+bi+ci)=2S(ai,bi,ci).
Therefore, S(ai,bi,ci)≤21S(ai+1,bi+1,ci+1) for all i=0,1,2,3,4. Hence,
S(a0,b0,c0)≤21S(a1,b1,c1)≤221S(a2,b2,c2)≤⋯≤251S(a5,b5,c5)==322016=63.
Thus, the sum of the initial numbers on the blackboard is less than or equal to 63.
The following example shows that the sum of the initial numbers on the blackboard can be equal to 63. Let a0=b0=c0=21, then
(a0,b0,c0)=(21,21,21)⟶(42,42,42)=(2⋅21,2⋅21,2⋅21)⟶(22⋅21,22⋅21,22⋅21)⟶⟶…⟶(25⋅21,25⋅21,25⋅21)=(a5,b5,c5),
and the sum
S(a5,b5,c5)=S(25⋅21,25⋅21,25⋅21)=25S(21,21,21)=32⋅63=2016.