how to use recursion to find the biggest subsequence below a certain length

Question

the example is below:

def max_subsequence(n,t):
    >>> max_subseq(20125, 5)
    20125
    >>> max_subseq(20125, 6) # note that 20125 == 020125