Hide
Problem B
Sequence
Design an algorithm that generates the first $n$ numbers in the following sequence: $1, 2, 3, 6, 11, 20, 37, \dots $
Input
Input consists of one integer $n$, the length of the sequence that should be generated, where $1 \leq n \leq 100$.
Output
Output consists of $i$ lines where the $i-th$ line contains one number, the $i-th$ number in the sequence.
| Sample Input 1 | Sample Output 1 |
|---|---|
7 |
1 2 3 6 11 20 37 |
| Sample Input 2 | Sample Output 2 |
|---|---|
15 |
1 2 3 6 11 20 37 68 125 230 423 778 1431 2632 4841 |
