# 3.2: Recognising Sequences

For some of the sequences we can predict the \(n^{th} \) term easily, and the formula can be checked using induction.

#### Example \(\PageIndex{1}\): Harmonic sequence

Find a formula for the \(n^{th}\) term of the following sequence: \(\displaystyle \frac{1}{2}. \displaystyle\frac{1}{3}. \displaystyle\frac{1}{4}. \cdots\).

#### Example \(\PageIndex{2}\): One's

\(1 \times 11=11\)

\(11 \times 11=121\)

\(111 \times 111=12321\)

\(1111 \times 1111=1234321\)

Can you predict the pattern?

#### Example \(\PageIndex{3}\): Perfect Squares

Find a formula for the \(n^{th}\) term of the following sequence \(1,4,9,16,25,\cdots\).

Here is another way to find the \(n^{th}\) term:

Note that the difference in the sequence \(1,4,9,16,25,\cdots\) is \(3,5,7,9,\cdots\) and the difference in this sequence is \(2\). Therefore the \(n^{th}\) can be written as a quadratic formulae \(pn^2+qn+c\). \(p,q,c\) can be found using the following information:

\(t_n\) | \(d_n=t_n-t_{(n-1)}\) | \(d=d_n-d_{(n-1)}\) | |
---|---|---|---|

n=1 | p+q+c | ||

n=2 | 4p+2q+c | 3p+q | |

n=3 |
9p+3q+c | 5p+q | 2p |

n=4 | 16p+4q+c | 7p+q | 2p |

Hence, in our case, \(2p=2\). Therefore, \(p=1\). Now \(3p+q=3 \) and \(p=2\). Thus \(q=0\). Now \(p+q+c=1\), which implies \(c=0\). Hence, \(t_n=n^2\).

### Quadratic Sequences:

A sequence is called quadratic sequence if the differences of consecutive terms, \( d_n=t_n−t_{(n−1)} \) differ by the same amount \(d=d_n−d_(n−1), \forall n \in \bf{N} \). In this case, the \(n^{th}\) term of the sequence is given by

\(t_n= a+(n-1) d_1+(n-1)(n-2)d/2\),

where \(d_1\) is the first difference between first term and the second term of the sequence, and \(d\) is the common second difference. This result can be shown by using induction.

Below is another way to solve:

#### Example \(\PageIndex{4}\): Quadratic Sequences

Find a formula for the \(n^{th}\) term of the following sequence: \(2,6,12,20,\cdots\)

2 6 12 20

4 6 8

2 2

Hence the \(n^{th}\) term has a term \((2/2) n^2.\)

\(t_n\) | 2 | 6 | 12 | 20 |

\(n^2\) | 1 | 4 | 9 | 16 |

\(n^2-t_n \) | 1 | 2 | 3 | 4 |

Notice that \(n^2-t_n \) is an arithmetic sequence with the first term \(1\) and the common difference is \(1\). Thus \(n^2-t_n =1+1(n-1)\). Hence \(t_n=n^2-n.\)

### Triangular numbers

**Thinking Out Loud:**

\(1, 3, 6, 10, 15, 21, 28, ...\) are triangular numbers: you can arrange them in a triangular array:

\(T_n = n\)^{th} triangular number. What is the hundredth triangular number?

#### Example \(\PageIndex{5}\): Hexagonal Tilling (Centered hexagonal numbers)

Find the \(n^{th}\) term of the sequence \(1,7,19, 37, \cdots\).

There are 6 triangular numbers and 1 center, Therefore \(6 \frac{(n - 1)(n)}{2} + 1 = 3(n -1)(n) + 1 = 3(n^{2} - n) + 1 = 3n^{2} - 3n + 1 . \)

### Tower of Hanoi

According to the legend of the Tower of Hanoi (formerly the "Tower of Brahma" in a temple in the Indian city of Benares), the temple priests are to transfer a tower consisting of 64 fragile disks of gold from one part of the temple to another, one disk at a time. The disks are arranged in order, no two of them the same size, with the largest on the bottom and the smallest on top. Because of their fragility, a larger disk may never be placed on a smaller one, and there is only one intermediate location where disks can be temporarily placed. It is said that before the priests complete their task the temple will crumble into dust and the world will vanish in a clap of thunder.

Move 1: move disk 1 to post C

Move 1: move disk 2 to post B

Move 2: move disk 1 to post C

Move 3: move disk 2 to post C

Move 1: move disk 3 to post C

Move 2: move disk 2 to post B

Move 3: move disk 3 to post B

Move 4: move disk 1 to post C

Move 5: move disk 3 to post A

Move 6: move disk 2 to post C

Move 7: move disk 3 to post C

Number of Disks Min. number of Moves

1 1

2 3

3 7

4 15

5 31

#### Recursive Sequences

Definition

A sequence can be defined many different ways.

### Fibonacci Sequences

**Thinking Out Loud:**

A tiling consists of covering a region using tile pieces from some given set so that the region is completely covered without overlaps. How many ways can you arrange the 2 x 1 dominoes to cover 2 x n checker-board?

Fibonacci sequence: \(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, , ...\)

Let \(F_n = n\)^{\(th\)}^{ }Fibonacci Number.The \(n\) term in the Fibonacci sequence is obtained by adding the previous two terms.

That is, \(F_n = F\)_{\((n - 1)\)} \(+ \, F\)_{\((n - 2)\)}, \(n > 2, \, F_1=1, \) and \( F_2 = 1\)

Some facts about Fibonacci sequence :

- The sum of the first n even numbered Fibonacci numbers is one less than the next Fibonacci number.
- The only square Fibonacci numbers are 0, 1 and 144.
- The sum of the first n odd numbered Fibonacci numbers is the next Fibonacci number.

Example \(\PageIndex{1}\):

Consider the Fibonacci sequence: \(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, , ...\)

The squares of the Fibonacci sequence: \( 1,1,4,9,25, 169 ....\)

1+1=2

1+1+4 =6

1+1+4+9+25=

#### Example \(\PageIndex{6}\): Flip triangles

Below are the rules for playing:

The goal is to shift the chip triangle exactly upside down.

You must use few steps as possible.

You must keep track of your slides and count the total chips.

Record your information in the table

Investigate the problems:

1.Do you see a pattern emerging? If yes explain. If not, explain what was missing to complete a pattern...

2. Do the results connect to Fibonacci? If yes how & EXPLAIN? If no, can you identify the sequence?

#### Example \(\PageIndex{7}\): More Fibonacci

Let \(a_n\) be the Fibonacci sequence. That is \(a_n=a_{n-1}+a_{n-2}, n \in \mathbb{N}, \mbox{ with } a_1=1,a_0=0\), where \( \mathbb{N}\) be the set of all natural numbers.

Consider the Fibonacci squares illustrated in figure:

Let \(h_n\) be the shortest (perpendicular) distance between \(n^{th}\) parallel diagonal vectors. Consider the figure:

Comparing the the area of trapezoids, we get

\(h_n=\displaystyle\frac{a_n^2-a_{n-1}^2} {\sqrt{2}(a_n-a_{n-1})} =\displaystyle\frac{1}{\sqrt{2}}\left(a_n+a_{n-1}\right).\)

Hence, \(h_n\) is Fibonacci like sequence.

Tower of Hanoi By André Karwath aka Aka (Own work) [CC BY-SA 2.5 (https://creativecommons.org/licenses/by-sa/2.5)], via Wikimedia Commons

Finacci Rabits By Ein_Hase_mit_blauem_Ei.svg: MichaelFrey & Sundance Raphael derivative work: HB (Ein_Hase_mit_blauem_Ei.svg) [CC BY-SA 3.0 (https://creativecommons.org/licenses/by-sa/3.0) or GFDL (http://www.gnu.org/copyleft/fdl.html)], via Wikimedia Commons