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 two immediate predecessors. The first two numbers in the sequence are 1 and 2 respectively. The input N to the algorithm is an integer greater than or equal to 3. The 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 = 3 Output: 1, 2, 3

N = 4 Output: 1, 2, 3

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

N = 21 Output: 1, 2, 3, 5, 8, 13, 21

Must be an executable Raptor file of your flowchart.