a) Consider the following sequence of numbers: 0, 1, 2, 3, 6, 11, 20, 37, 68,...

 

Transcribed Image Text:

a) Consider the following sequence of numbers: 0, 1, 2, 3, 6, 11, 20, 37, 68, 125, 230, 423, 778 ... The sequence starts 0, 1, 2, and from then on, each number is the sum of the previous three numbers. Write a RECURSIVE function called sequence () which takes an integer, n, as a parameter and returns the value at position n in this sequence assuming that n is a positive integer. For example: sequence (0) returns 0 sequence (1) returns 1 sequence (2) returns 2 sequence (3) returns 3 sequence (4) returns 6 etc -TE def sequence (num): a) Consider the following sequence of numbers: 0, 1, 2, 3, 6, 11, 20, 37, 68, 125, 230, 423, 778 ... The sequence starts 0, 1, 2, and from then on, each number is the sum of the previous three numbers. Write a RECURSIVE function called sequence () which takes an integer, n, as a parameter and returns the value at position n in this sequence assuming that n is a positive integer. For example: sequence (0) returns 0 sequence (1) returns 1 sequence (2) returns 2 sequence (3) returns 3 sequence (4) returns 6 etc -TE def sequence (num):

Answer rating: 100% (QA)

gger for cc ebug share S new ming estions with 1 mainpy 12345678 ... View the full answer