Chapter 19, Problem 21RQ

The Fibonacci sequence is an integer sequence calculated by adding the previous two numbers together to calculate the next value. This is represented mathematically by saying that: F_n = F_n–1 + F_n–2 (where F_n is the n^th value n the sequence, F) or:

Note this sequence starts with the undefined values (0, 1) end calculates the remaining values in the sequence based on the sum of the previous two values.

Professor Bowman found this sequence to be extremely insufficient and created the Bowman sequence, which is an integer sequence calculated by adding the previous three numbers together (instead of two like in the Fibonacci sequence) to calculate the next value This is represented mathematical by saying that F_n = F_n–1 + F_n–2 + F_n–3 (where F_n is the nth value in the sequence, F) or:

Note this sequence starts with the underlined values (0, 1, 2) and calculates the remaining values in the sequence based on the sum of the previous three values.

Write a MATLAB function that implements the Bowman sequence that accepts one input argument, the length of the desired Bowman sequence to generate, and returns one output variable, the Bowman sequence stored in a row vector. This function should also check to see if the number passed in to the function is a valid Bowman sequence length (think about what might constitute valid sequence lengths!). If the input is invalid, your function should display a warning message and the output variable should contain only one number: –1. Otherwise if the input is valid, your function should calculate the Bowman sequence and display each value in the sequence in the Command Window.

Sample Output: