Algorithmic Problem Solving

1-Develop an algorithm, in the form of a flowchart, to display the sequence of numbers from 1 to N, such that each number in the sequence is equal to the sum of its three immediate predecessors. The first three numbers in the sequence are 1, 2 and 2 respectively. The user input N to the algorithm is an integer greater than or equal to 5. The expected output of the algorithm is given below for example values of the input N. Note that N may not always be part of the sequence.

N = 5 Output: 1, 2, 2, 5

N = 8 Output: 1, 2, 2, 5

N = 10 Output: 1, 2, 2, 5, 9

N = 41 Output: 1, 2, 2, 5, 9, 16, 30