Find a formula which gives the number of matches, S, required to construct n diagram.

Diagram 1 has 8 matches
Diagram 2 has 15 matches
Diagram 3 has 22 matches

1 answer

Looks like 7n+1