Question

Please help! I would really appreciate it.

(20 points) You have the following sequence of numbers: 1, 2, 4, 7, 11, 16, 22, 29, 37, 46, 56, 67, 79, 92, Find the recursive rule from the above series, and give a recursive definition, and write a function that implements the definition. (Note: f(1) - 1, f(2 ) -2. f (3) 4. f(4) 7,...)

Answer 1

"Given that * The following sequence of numbers 1, 2, 4, 7, 11, 16, 22, 29, 37, 46, 56, 67, 79, 92... Then, * Find the recursive rule from the above series and give recursive definition and write a function that implement & the definition [Note f(1) = 1, f(2) = 2, f(3) = 4, f(4) = 7...] Now, given Sequence, 1, 2, 4, 7, 11, 16, 22, 29, 37, 46, 56, 67, 79, 92... implies Recursive Definition: - When we define a Sequence recursively, i.e., A recursively defined function 'f' with domain N is a function defined by * Basic step: Specify the value of function at zero * Recursive Step: ""Give a rule for findings its value at an integer from its values at smaller integers"" Such a definition is called ""recursive"" * Given data can be written in tabular form, The sequence is f(1) = 1 f(2) = 2 = 1 + 1 f(3) = 4 = 2 + 2 "