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 As Byte = 3 To 100
    For j As Byte = i-1 To 1 Step -1
        If i Mod j = 0 Then Print Using "###"; j; : Exit For
    Next  j
    If i Mod 10 = 0 Then Print
Next i
Sleep