Question

Consider the recurrence relation an=n2an−1−an−2an=n2an−1−an−2 with initial conditions a0=1a0=1 and a1=2a1=2.

Write a Python function called sequence_slayer that takes a nonnegative integer argument NN less than 50 and returns the NN-th term in the sequence defined by the above recurrence relation.

For example, if N=2N=2, your function should return sequence_slayer(2) = 7, because aN=a2=(2)2⋅(2)−(1)=7aN=a2=(2)2⋅(2)−(1)=7.

For example:

Test	Result
print(sequence_slayer(2))	7
print(sequence_slayer(3))	61
print(sequence_slayer(8))	2722564729

Answer 1

IF YOU HAVE ANY DOUBTS COMMENT BELOW I WILL BE THERE TO HELP YOU

ANSWER:

CODE:

def sequence_slayer(n):

if n==0:

return 1

elif n==1:

return 2

else:

return ( (n*n*(sequence_slayer(n-1))) - sequence_slayer(n-2) )

print(sequence_slayer(2))

print(sequence_slayer(3))

print(sequence_slayer(8))