4.2 Alternating, Interleaved & Fibonacci Sequences

Alternating, Interleaved & Fibonacci Sequences

Core Concept: When a number sequence defies simple first- and second-order differences, it is almost certainly operating on an interleaved (multi-thread) structure or a recursive additive rule. Success on selective entry exams depends on recognizing the visual hallmarks of interleaving—such as saw-tooth oscillations and extended question lengths—within five seconds.

Series questions in reasoning tests often penalise candidates who assume that every sequence progresses through a single, continuous relationship between adjacent numbers. When two independent progressions are interwoven, adjacent differences appear chaotic, erratic, and nonsensical. Untrained students waste 45 seconds calculating fluctuating differences. High-scoring candidates immediately bifurcate the series into odd and even threads.

---

Anatomy of Interleaved (Dual-Pattern) Sequences

An interleaved sequence (often called an alternating or dual series) embeds two completely independent mathematical patterns into alternate positions of a single list.

Sequence:   T1      T2      T3      T4      T5      T6      T7      T8      T9
            │               │               │               │               │
Thread 1:   3       ───►    7       ───►    11      ───►    15      ───►   [19]  (Odd positions: +4)
                    │               │               │               │
Thread 2:           28      ───►    24      ───►    20      ───►    16           (Even positions: -4)

In this sequence:

• Odd-Position Thread ($T_1, T_3, T_5, T_7, T_9$): $3, 7, 11, 15, \dots$ follows an arithmetic progression with $d = +4$.
• Even-Position Thread ($T_2, T_4, T_6, T_8$): $28, 24, 20, 16, \dots$ follows an arithmetic progression with $d = -4$.

Because the desired missing value is $T_9$ (an odd index), you only need to evaluate Thread 1: $15 + 4 = 19$. Evaluating Thread 2 is helpful for confirmation, but with only 30 to 45 seconds per item, identifying the target index immediately prevents wasted effort.

Worked Example: Dual Interleaved with Diverse Operations

$\text{Find the missing term: } 2,\ 40,\ 6,\ 35,\ 18,\ 30,\ 54,\ 25,\ ?$

• Step 1 (Check index parity): The sequence contains 8 terms. We need $T_9$ (an odd position).
• Step 2 (Isolate the odd-position thread): $T_1 = 2,\ T_3 = 6,\ T_5 = 18,\ T_7 = 54,\ T_9 = ?$ Examine the transitions: $2 \times 3 = 6$ $6 \times 3 = 18$ $18 \times 3 = 54$ The odd thread is a geometric progression with common ratio $r = 3$.
• Step 3 (Calculate target term): $T_9 = 54 \times 3 = 162$
• Verification (Even-position thread): $T_2 = 40, T_4 = 35, T_6 = 30, T_8 = 25$ (arithmetic series with $d = -5$). Thread 2 is completely independent and confirms the dual-thread architecture.

---

The 3 Diagnostic Red Flags of Interleaved Sequences

You can spot an interleaved sequence almost instantly by watching for three physical characteristics:

1. The Saw-Tooth (Zig-Zag) Trajectory

If the sequence repeatedly rises and falls ($up \to down \to up \to down$), adjacent differences cannot be constant. For example, in $4, 25, 8, 20, 12, 15$, the numbers alternate between expansion and contraction. Single monotonic series do not zig-zag.

2. Stem Length Exceeding 6 Terms

A single-rule sequence typically requires only 4 or 5 terms to define the pattern unambiguously (e.g., $3, 9, 27, 81, ?$ gives 4 terms). However, for an interleaved pattern, an examiner must provide at least 3 terms per thread so the candidate can verify the rule. Therefore, any question stem displaying 7, 8, 9, or 10 terms is an overwhelming candidate for interleaving.

3. Plateauing or Static Anchor Terms

If a specific number repeats every other term (e.g., $7, 12, 7, 19, 7, 26, 7, ?$), one thread is a static constant ($7$), while the other thread progresses ($+7$). Do not try to integrate the repeating number into an adjacent difference formula.

---

Triple Interleaved Sequences (Three Threads)

Harder scholarship-level series occasionally use triple interleaved series. Here, three distinct rules cycle sequentially across positions:

• Thread A (Positions $1, 4, 7, 10, \dots$): Follows Rule 1
• Thread B (Positions $2, 5, 8, 11, \dots$): Follows Rule 2
• Thread C (Positions $3, 6, 9, 12, \dots$): Follows Rule 3

Index:    1    2    3    4    5    6    7    8    9   10   11   12
Terms:    1   40   90    3   36   80    5   32   70    7   28   [?]
          │              │              │              │
Thread A: 1  ──────────► 3  ──────────► 5  ──────────► 7             (+2)
               │              │              │              │
Thread B:     40 ──────────► 36 ──────────► 32 ──────────► 28        (-4)
                    │              │              │              │
Thread C:          90 ──────────► 80 ──────────► 70 ──────────► [60] (-10)

Worked Example: Solving a Triple Thread Under 25 Seconds

$\text{Find the missing term: } 1,\ 40,\ 90,\ 3,\ 36,\ 80,\ 5,\ 32,\ 70,\ 7,\ 28,\ ?$

• Step 1 (Identify total term count): 11 terms provided; we need $T_{12}$.
• Step 2 (Determine thread index): $12 \pmod 3 = 0$, which corresponds to the third position in each cycle ($T_3, T_6, T_9, T_{12}$).
• Step 3 (Extract Thread C): $T_3 = 90,\ T_6 = 80,\ T_9 = 70,\ T_{12} = ?$
• Step 4 (Compute result): The pattern is an arithmetic progression with common difference $d = -10$. $T_{12} = 70 - 10 = 60$

Notice that Threads A and B do not need to be solved to find the correct answer, saving at least 15 seconds of working.

---

Fibonacci & Generalised Additive Sequences

A recursive sequence is one where terms are computed from one or more preceding terms rather than from a fixed index formula. The most famous recursive pattern is the Fibonacci sequence.

$\text{Governing Rule: } T_n = T_{n-1} + T_{n-2}$

$\text{Standard Fibonacci: } 0,\ 1,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 21,\ 34,\ 55,\ 89,\ 144,\ 233, \dots$

Generalised Additive (Lucas-Type) Sequences

Examiners rarely use the standard Fibonacci starting numbers ($0, 1$). Instead, they choose arbitrary starting integers (seeds) and apply the same additive principle:

• Seed $(2, 5)$: $2, 5, 7, 12, 19, 31, 50, 81, 131, \dots$
• Seed $(4, 9)$: $4, 9, 13, 22, 35, 57, 92, 149, \dots$

Tribonacci Sequences (Three-Term Additions)

In a Tribonacci sequence, each term is generated by summing the three preceding terms:

$T_n = T_{n-1} + T_{n-2} + T_{n-3}$ $\text{Example: } 1,\ 1,\ 2,\ 4,\ 7,\ 13,\ 24,\ 44,\ 81,\ 149, \dots$ $\text{Verification: } 1+1+2=4;\ 1+2+4=7;\ 2+4+7=13;\ 4+7+13=24;\ 7+13+24=44$

---

Modified Additive Sequences with Offsets

To increase difficulty, scholarship examiners frequently introduce a constant offset ($k$) into the additive rule:

$T_n = T_{n-1} + T_{n-2} \pm k$

Worked Example: Additive Sequence with Constant Offset

$\text{Find the missing term: } 2,\ 3,\ 6,\ 10,\ 17,\ 28,\ ?$

• Step 1 (Test simple addition):
  • $2 + 3 = 5 \neq 6$ (Target is $5 + 1$)
  • $3 + 6 = 9 \neq 10$ (Target is $9 + 1$)
  • $6 + 10 = 16 \neq 17$ (Target is $16 + 1$)
  • $10 + 17 = 27 \neq 28$ (Target is $27 + 1$)
• Step 2 (Establish governing rule): The rule is: sum the previous two terms and add $1$: $T_n = T_{n-1} + T_{n-2} + 1$
• Step 3 (Calculate target term): $T_7 = 17 + 28 + 1 = 45 + 1 = 46$

---

Alternating Single-Thread Operation Rules

Distinct from interleaved series (which have two separate sets of numbers), an alternating operational sequence consists of a single linear chain of numbers governed by two different mathematical operations applied alternately:

$\text{Pattern: } \text{Op}_1 \longrightarrow \text{Op}_2 \longrightarrow \text{Op}_1 \longrightarrow \text{Op}_2 \dots$

Common operation pairings include:

• Multiply / Subtract: $\times 3$, then $-3$, then $\times 3$, then $-3$
• Add / Multiply: $+4$, then $\times 2$, then $+4$, then $\times 2$
• Multiply / Divide: $\times 4$, then $\div 2$, then $\times 4$, then $\div 2$

Worked Example: Alternating Operations

$\text{Find the missing term: } 4,\ 12,\ 9,\ 27,\ 24,\ 72,\ 69,\ ?$

• Step 1 (Analyze adjacent transitions):
  • $4 \to 12$: Multiply by $3$ ($4 \times 3 = 12$)
  • $12 \to 9$: Subtract $3$ ($12 - 3 = 9$)
  • $9 \to 27$: Multiply by $3$ ($9 \times 3 = 27$)
  • $27 \to 24$: Subtract $3$ ($27 - 3 = 24$)
  • $24 \to 72$: Multiply by $3$ ($24 \times 3 = 72$)
  • $72 \to 69$: Subtract $3$ ($72 - 3 = 69$)
• Step 2 (Determine next operation): The sequence alternates between $\times 3$ and $-3$. The last step was $-3$, so the next operation must be $\times 3$.
• Step 3 (Calculate target term): $69 \times 3 = 207$

---

Interleaving Diagnostic Flowchart & Strategy Reference

[Is adjacent difference erratic, alternating signs, or non-monotonic?]
                          │
                          ▼
[Count Total Given Terms in the Stem]
       ├── 7 to 9 terms? ──► DUAL INTERLEAVED (Skip 1 term: test T1-T3-T5 and T2-T4-T6)
       └── 10+ terms?    ──► TRIPLE INTERLEAVED (Skip 2 terms: test T1-T4-T7)
                          │ (If terms do not skip-step clean)
                          ▼
[Test Recursive Additive Properties]
       ├── Does T1 + T2 = T3?     ──► GENERALISED FIBONACCI
       ├── Does T1 + T2 + k = T3? ──► MODIFIED FIBONACCI (+/- k)
       └── Does T1 + T2 + T3 = T4?──► TRIBONACCI
                          │ (If recursive fails)
                          ▼
[Test Alternating Dual Operations: Op1, Op2, Op1, Op2]

---

High-Yield Traps in Alternating Sequences

1. Parity Inversion Error

The most common error on interleaved questions is calculating the correct continuation for the wrong thread. If a sequence has 8 terms ($T_1$ to $T_8$) and asks for the next term, you need $T_9$, which belongs to the odd thread. Rushing students often continue Thread 2 (even) from $T_8$, producing an answer that is almost guaranteed to be waiting as an enticing distractor.

2. The Arithmetic Rabbit Hole on Zig-Zags

When candidates see $3, 28, 7, 24, 11, 20$, they often begin calculating differences: $+25, -21, +17, -13, +9$. While this specific alternating difference series does form an arithmetic pattern (decreasing by $4$), solving it this way requires twice as much arithmetic and cognitive load as simply recognizing two arithmetic threads ($3, 7, 11 \to +4$ and $28, 24, 20 \to -4$). Always favor decoupled threads over complex alternating difference tiers.

3. Blind Spot for Additive Sequences

Because students are conditioned to look for common differences or common ratios, recursive additions ($T_n = T_{n-1} + T_{n-2}$) frequently cause candidates to freeze. If differences between consecutive terms resemble the terms themselves, immediately test for an additive Fibonacci relationship.