Develop an algorithm, in the form of a Raptor flowchart, to generate and display the triangular

number sequence of length $n,$ where $n$ is a positive integer. The sequence starts with $1.$ Each

subsequent number in the sequence is the total number of dots that form a triangle by adding

another row of dots to the triangle for the previous number in the sequence, as illustrated for the

case of $n=4,n=5$ and $n=6$ respectively.

$n=4$ sequence: $1,3,6,10$

The following are three examples of the expected input$/$output behavior of the

algorithm:

$n=4,$ Output: $1,3,6,10$

$n=5,$ Output: $1,3,6,10,15$

$n=6,$ Output: $1,3,6,10,15,21$