Task
a(1) = 1; for n > 1, a(n) = largest proper divisor of n, where n < 101 .


print "El mayor divisor propio de n es:\n"
print " 1  1 "; 
for i = 3 to 100
	for j = i-1 to 1 step -1
		If mod(i, j) = 0 then print j using "##"; : break : fi
	next  j
    if mod(i, 10) = 0 then print : fi
next i
print
end