(a)[1]
Fill in the table for the patterns in this sequence.
(b)[2]
Find an expression, in terms of $n$, for how many counters Pattern $n$ contains.
(c(i))[3]
Ken has a bag containing $1358$ counters. He uses these counters to create the largest possible pattern in the sequence, Pattern $p$. Find the value of $p$.
(c(ii))[2]
He uses all of the counters left over to make another pattern in the sequence, Pattern $q$. Find the value of $q$.