11  22  33  44  a  
27  48  69  90  b  
36  72  144  288  c  
3  9  27  81  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.
If you don't have the time to provide feedback we'd really appreciate it if you could give this page a score! We are constantly improving and adding to these starters so it would be really helpful to know which ones are most useful. Simply click on a button below:
This starter has scored a mean of 3.1 out of 5 based on 491 votes.
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 chosen and recommended by Transum Mathematics to get you started.
Hello WorldYou are buying a (driverless) car. One vehicle is programmed to save as many lives as possible in a collision. Another promises to prioritize the lives of its passengers. Which do you choose? Welcome to the age of the algorithm, the story of a nottoodistant future where machines rule supreme, making important decisions – in healthcare, transport, finance, security, what we watch, where we go even who we send to prison. So how much should we rely on them? What kind of future do we want? Hannah Fry takes us on a tour of the good, the bad and the downright ugly of the algorithms that surround us. In Hello World she lifts the lid on their inner workings, demonstrates their power, exposes their limitations, and examines whether they really are an improvement on the humans they are replacing. more... 
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."