Minimum Value evenly divisible by all integers from 1 to n
Your code can be more pythonic.


Names of variables and functions should be more meaningful and descriptive. Also - read PEP8.
You should encapsulate your code in smaller functions responsible
for one thing. And signal what is the purpose of each function by
it's name (= meaningful names).
Use power which python gives you. To save memory instead of range() use xrange() in every case when you only need to iterate over. range() creates a list, so if you do range(1, 99999) it creates a list in memory with 99999 elements. In contrast xrange() is a sequence object that evaluates lazily. 
There are more efficient algorithms than brute-force. But even your
brute-force approach can be improved. With xranege() you don't
need recursion any more. What is more it's wiser to iterate over
dividers in decreasing order. Which is dead simple in python, just use -1 as third xrange() parameter (step).


Take a look at this example:

def smallest_common_multiple(maximal_divisor):
    for number in xrange(maximal_divisor, sys.maxsize):
        if is_common_multiple(number, maximal_divisor):
            return number

def is_common_multiple(number, maximal_divisor):
    for divisor in xrange(maximal_divisor, 1, -1):
        if number % divisor != 0:
            return False
    return True


Comment: 

In smallest_common_multiple() iteration starts from maximal_divisor because smaller numbers doesn't make sense. sys.maxsize works like to infinity.

:-) 

Update

As Josay points out this can be even simpler. Thanks Josay!

from itertools import count

def smallest_common_multiple(maximal_divisor):
    for number in count(maximal_divisor):
        if is_common_multiple(number, maximal_divisor):
            return number

def is_common_multiple(number, maximal_divisor):
    return all([number % divisor == 0 for divisor in xrange(maximal_divisor, 1, -1)])