
    Design a function for an automated grading system that evaluates a student's ability to calculate specific positions in mathematical sequences by finding the n'th term in the Lucas sequence, where each term is the sum of the two preceding ones starting with 2 and 1. The system will use this function to assess students' understanding of recursive mathematical patterns and provide targeted feedback on their comprehension of sequence calculations.
    

    
def find_lucas(n):
    """
    Design a function for an automated grading system that evaluates a student's ability to calculate specific positions in mathematical sequences by finding the n'th term in the Lucas sequence, where each term is the sum of the two preceding ones starting with 2 and 1. The system will use this function to assess students' understanding of recursive mathematical patterns and provide targeted feedback on their comprehension of sequence calculations.
    

    """
def find_lucas(n):
    """
    Design a function for an automated grading system that evaluates a student's ability to calculate specific positions in mathematical sequences by finding the n'th term in the Lucas sequence, where each term is the sum of the two preceding ones starting with 2 and 1. The system will use this function to assess students' understanding of recursive mathematical patterns and provide targeted feedback on their comprehension of sequence calculations.
    

    """
    if n == 0:
        return 2
    if n == 1:
        return 1
    return find_lucas(n - 1) + find_lucas(n - 2)