4  8  12  16  a  
24  52  80  108  b  
2  4  8  16  c  
37  74  148  296  d  
10  9  60  90  e 
Hint: Scroll down this page to see the extension activity (Extension 2) for help with the fifth sequence above.
How did you use this starter? Can you suggest
how teachers could present or develop this resource? Do you have any comments? It is always useful to receive
feedback and helps make this free resource even more useful for Maths teachers anywhere in the world.
Click here to enter your comments.
Previous Day  This starter is for 31 March  Next Day
Can you also find a general rule for predicting the nth term of the sequences?
n^{th} term
Note to teacher: Doing this activity once with a class helps students develop strategies. It is only when they do this activity a second time that they will have the opportunity to practise those strategies. That is when the learning is consolidated. Click the button above to regenerate another version of this starter from random numbers.
Your access to the majority of the Transum resources continues to be free but you can help support the continued growth of the website by doing your Amazon shopping using the links on this page. Below is an Amazon search box and some items I have chosen and recommend to get you started. As an Amazon Associate I earn a small amount from qualifying purchases which helps pay for the upkeep of this website.
Teacher, do your students have
access to computers? 

Here a concise URL for a version of this page without the comments.
Here is the URL which will take them to sequences of patterns made with matchsticks.
There is an old tradition of using logic puzzles to test job candidates at interview. Here is the version of part (e) above that is said to be asked of Google job candidates:
Count the number of letters in the words of the numbers in the sequence.
The numbers are the largest numbers that can be spelled in a given number of letters.
Some say 96 but others have said 'one googol' or even 'ten googol'! More information about this question can be found in the excellent book 'Are you smart enough to work at Google?' by William Poundstone."