Recursive function to return sum of greatest odd divisor of numbers in range [ 1 , n ]
def sum ( n ) : NEW_LINE INDENT if ( n == 0 ) : NEW_LINE INDENT return 0 ; NEW_LINE DEDENT if ( n % 2 == 1 ) : NEW_LINE DEDENT