Question

6 annoying_int_sequence(n) In annoying_recursion.py, write the function annoying_int_sequence(n) which takes a single integer parameter (which must be non-negative). It must return a list of intgers. The contents of the integers are defined recursively. Basically, each version of this sequence is made up of the next-smaller one, repeated n times - and with the number n in-between. For instance, the sequence for n = 3 is: ???? 3 ???? 3 ???? Just drop in the the sequence for 1 - 2 in-between. The sequence for n = 0, as you might guess, is an empty list. So, the first few sequences are: n sequence -empty- 1 1 2 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 3 1 2 1 4 ... This function must obey the Annoying Requirements. 6.1 Hints First, it would be silly to call the recursive function multiple times. Call it once. and save the shorter sequence into a variable, so that you can re-use it over and over Second, joining together multiple copies is hard to do without a loop! But how did you create long strings for printing in the valley" problem. Can you do something similar here

In python please

Answer 1

Given below is the code for the question. PLEASE MAKE SURE INDENTATION IS EXACTLY AS SHOWN IN IMAGE.
Please do rate the answer if it helped. Thank you.

def annoying_int_sequence(n):
   #print(n)
   if n == 0:
       return []
   elif n == 1:
       return [1]
   else:
       seq1 = annoying_int_sequence(n-1)
       seq2 = seq1 + [n]
       return seq2 * (n-1) + seq1

#testing the function
print('n \t sequence')
for i in range(5):
   print('{} \t {}'.format(i, annoying_int_sequence(i)))

2 3 TH 4 5 def annoying_int_sequence (n) : #print (n) if n == 0: return [] elif n == 1: return [1] else: seqi annoying_int_sequence (n-1) seq2 seql + [n] return seq2 * (n-1) +. seql 6 보로 7 8 9 10 11 12 13 14 #testing the function print('n \t. sequence') for i in range (5): print('{}.\t. []'.format(i, annoying_int_sequence (i)))|| 15

sequence [1] [1, 2, 1] [1, 2, 1, 3, 1, [1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1] 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1]