Study guide
4.2 Alternating, Interleaved & Fibonacci Sequences
Edutest Selective Entry & Scholarship Exam Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Results & Pacing Strategy
1.1 Exam Structure, Format & Test Battery 1.2 Results, Year-Level Norms & How Schools Select 1.3 Speed Tactics, Time Budgeting & Zero-Penalty Guessing
2 Chapter 2: Verbal Reasoning: Analogies, Classification & Vocabulary
2.1 Word Analogies & Semantic Relationships 2.2 Verbal Classification & Odd-One-Out 2.3 Advanced Vocabulary, Synonyms & Antonyms
3 Chapter 3: Verbal Reasoning: Codes, Sequences & Logical Deduction
3.1 Letter Codes & Cryptographic Shifts 3.2 Word Chains, Anagrams & Hidden Words 3.3 Verbal Deductive Logic & Syllogisms
4 Chapter 4: Numerical Reasoning: Sequences & Number Patterns
4.1 Arithmetic, Geometric & Two-Tier Differences 4.2 Alternating, Interleaved & Fibonacci Sequences 4.3 Square, Cube & Figurate Number Sequences
5 Chapter 5: Numerical Reasoning: Grids, Diagrams & Math Logic
5.1 Number Matrices & Grid Patterns 5.2 Geometric Shape Puzzles & Relational Diagrams 5.3 Cryptarithms & Quantitative Word Logic
6 Chapter 6: Reading Comprehension: Fiction & Literary Analysis
6.1 Narrative Structure, Plot Devices & Conflict 6.2 Figurative Language, Imagery & Tone 6.3 Characterization, Inferencing & Subtext
7 Chapter 7: Reading Comprehension: Non-Fiction, Poetry, Argument & Sentence Skills
7.1 Informational Text Structures & Main Idea 7.2 Poetry Analysis: Form, Rhyme, Rhythm & Meaning 7.3 Persuasive Techniques, Rhetoric & Author Bias 7.4 Sentence Correction, Sentence Completion & Punctuation
8 Chapter 8: Mathematics: Arithmetic, Fractions, Decimals & Percentages
8.1 Mental Arithmetic, Order of Operations & Number Properties 8.2 Fractions, Decimals & Mixed Operations 8.3 Percentages, Percentage Change & Financial Problems
9 Chapter 9: Mathematics: Rates, Ratios, Probability & Data
9.1 Ratios, Rates & Proportional Reasoning 9.2 Speed, Distance, Time & Combined Work 9.3 Probability, Counting Principles & Permutations 9.4 Data Interpretation, Dual-Axis Charts & Statistics
10 Chapter 10: Mathematics: Measurement, Geometry & Algebra
10.1 Perimeter, Area & Composite 2D Figures 10.2 Volume, Surface Area & 3D Spatial Visualization 10.3 Angles, Geometric Theorems, Polygons & Transformations 10.4 Algebraic Expressions, Linear Equations & Word Problems
11 Chapter 11: Written Expression: Narrative & Creative Writing
11.1 Narrative Architecture & Deconstructing Prompts 11.2 Sensory Immersion & Show-Don't-Tell Techniques 11.3 Mechanics, Punctuation Variety & Under-the-Gun Polish
12 Chapter 12: Written Expression: Persuasive & Expository Writing
12.1 Persuasive Prompt Deconstruction & Thesis Formation 12.2 High-Scoring Body Paragraphs: The PEEL/TEEL Framework 12.3 Expository Clarity, Rhetorical Flourish & Clincher Closures
4.2 Alternating, Interleaved & Fibonacci Sequences
Key Takeaways Explain This Topic AI
Interleaved (dual-thread) series weave two independent mathematical rules into a single sequence, alternating term by term between odd index positions (1, 3, 5...) and even index positions (2, 4, 6...).
The primary diagnostic indicator of an interleaved sequence is an oscillating zig-zag trajectory (up-down-up-down) or an unusually long stem of 7 or more terms.
Triple interleaved sequences alternate across three distinct threads (modulo 3: positions 1-4-7, 2-5-8, 3-6-9), requiring candidates to test steps of size 3 when dual interleaving fails.
Fibonacci and generalised additive sequences generate terms by summing the preceding two values (T_n = T_{n-1} + T_{n-2}), which examiners frequently disguise with constant offsets (+/- k).
Alternating operational rules apply two different operators sequentially to consecutive terms ( + a , × b , + a , × b +a, \times b, +a, \times b + a , × b , + a , × b ), requiring paired operational testing rather than static subtraction.
Last updated: October 2026
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 T_1, T_3, T_5, T_7, T_9 T 1 , T 3 , T 5 , T 7 , T 9 ): 3 , 7 , 11 , 15 , … 3, 7, 11, 15, \dots 3 , 7 , 11 , 15 , … follows an arithmetic progression with d = + 4 d = +4 d = + 4 .
Even-Position Thread ( T 2 , T 4 , T 6 , T 8 T_2, T_4, T_6, T_8 T 2 , T 4 , T 6 , T 8 ): 28 , 24 , 20 , 16 , … 28, 24, 20, 16, \dots 28 , 24 , 20 , 16 , … follows an arithmetic progression with d = − 4 d = -4 d = − 4 .
Because the desired missing value is T 9 T_9 T 9 (an odd index), you only need to evaluate Thread 1: 15 + 4 = 19 15 + 4 = 19 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
Find the missing term: 2 , 40 , 6 , 35 , 18 , 30 , 54 , 25 , ? \text{Find the missing term: } 2,\ 40,\ 6,\ 35,\ 18,\ 30,\ 54,\ 25,\ ? 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 T_9 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 = ? T_1 = 2,\ T_3 = 6,\ T_5 = 18,\ T_7 = 54,\ T_9 = ? T 1 = 2 , T 3 = 6 , T 5 = 18 , T 7 = 54 , T 9 = ? Examine the transitions: 2 × 3 = 6 2 \times 3 = 6 2 × 3 = 6 6 × 3 = 18 6 \times 3 = 18 6 × 3 = 18 18 × 3 = 54 18 \times 3 = 54 18 × 3 = 54 The odd thread is a geometric progression with common ratio r = 3 r = 3 r = 3 .
Step 3 (Calculate target term): T 9 = 54 × 3 = 162 T_9 = 54 \times 3 = 162 T 9 = 54 × 3 = 162
Verification (Even-position thread): T 2 = 40 , T 4 = 35 , T 6 = 30 , T 8 = 25 T_2 = 40, T_4 = 35, T_6 = 30, T_8 = 25 T 2 = 40 , T 4 = 35 , T 6 = 30 , T 8 = 25 (arithmetic series with d = − 5 d = -5 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 ( u p → d o w n → u p → d o w n up \to down \to up \to down u p → d o w n → u p → d o w n ), adjacent differences cannot be constant. For example, in 4 , 25 , 8 , 20 , 12 , 15 4, 25, 8, 20, 12, 15 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 , ? 3, 9, 27, 81, ? 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 , ? 7, 12, 7, 19, 7, 26, 7, ? 7 , 12 , 7 , 19 , 7 , 26 , 7 , ? ), one thread is a static constant ( 7 7 7 ), while the other thread progresses ( + 7 +7 + 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 , … 1, 4, 7, 10, \dots 1 , 4 , 7 , 10 , … ): Follows Rule 1
- Thread B (Positions 2 , 5 , 8 , 11 , … 2, 5, 8, 11, \dots 2 , 5 , 8 , 11 , … ): Follows Rule 2
Thread C (Positions 3 , 6 , 9 , 12 , … 3, 6, 9, 12, \dots 3 , 6 , 9 , 12 , … ): 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
Find the missing term: 1 , 40 , 90 , 3 , 36 , 80 , 5 , 32 , 70 , 7 , 28 , ? \text{Find the missing term: } 1,\ 40,\ 90,\ 3,\ 36,\ 80,\ 5,\ 32,\ 70,\ 7,\ 28,\ ? 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 T_{12} T 12 .
Step 2 (Determine thread index): 12 ( m o d 3 ) = 0 12 \pmod 3 = 0 12 ( mod 3 ) = 0 , which corresponds to the third position in each cycle ( T 3 , T 6 , T 9 , T 12 T_3, T_6, T_9, T_{12} T 3 , T 6 , T 9 , T 12 ).
Step 3 (Extract Thread C): T 3 = 90 , T 6 = 80 , T 9 = 70 , T 12 = ? T_3 = 90,\ T_6 = 80,\ T_9 = 70,\ T_{12} = ? 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 d = -10 d = − 10 . T 12 = 70 − 10 = 60 T_{12} = 70 - 10 = 60 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 .
Governing Rule: T n = T n − 1 + T n − 2 \text{Governing Rule: } T_n = T_{n-1} + T_{n-2} Governing Rule: T n = T n − 1 + T n − 2
Standard Fibonacci: 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , 233 , … \text{Standard Fibonacci: } 0,\ 1,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 21,\ 34,\ 55,\ 89,\ 144,\ 233, \dots Standard Fibonacci: 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , 233 , …
Generalised Additive (Lucas-Type) Sequences
Examiners rarely use the standard Fibonacci starting numbers ( 0 , 1 0, 1 0 , 1 ). Instead, they choose arbitrary starting integers (seeds) and apply the same additive principle:
Seed ( 2 , 5 ) (2, 5) ( 2 , 5 ) : 2 , 5 , 7 , 12 , 19 , 31 , 50 , 81 , 131 , … 2, 5, 7, 12, 19, 31, 50, 81, 131, \dots 2 , 5 , 7 , 12 , 19 , 31 , 50 , 81 , 131 , …
Seed ( 4 , 9 ) (4, 9) ( 4 , 9 ) : 4 , 9 , 13 , 22 , 35 , 57 , 92 , 149 , … 4, 9, 13, 22, 35, 57, 92, 149, \dots 4 , 9 , 13 , 22 , 35 , 57 , 92 , 149 , …
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 T_n = T_{n-1} + T_{n-2} + T_{n-3} T n = T n − 1 + T n − 2 + T n − 3 Example: 1 , 1 , 2 , 4 , 7 , 13 , 24 , 44 , 81 , 149 , … \text{Example: } 1,\ 1,\ 2,\ 4,\ 7,\ 13,\ 24,\ 44,\ 81,\ 149, \dots Example: 1 , 1 , 2 , 4 , 7 , 13 , 24 , 44 , 81 , 149 , … Verification: 1 + 1 + 2 = 4 ; 1 + 2 + 4 = 7 ; 2 + 4 + 7 = 13 ; 4 + 7 + 13 = 24 ; 7 + 13 + 24 = 44 \text{Verification: } 1+1+2=4;\ 1+2+4=7;\ 2+4+7=13;\ 4+7+13=24;\ 7+13+24=44 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 k k ) into the additive rule:
- T n = T n − 1 + T n − 2 ± k T_n = T_{n-1} + T_{n-2} \pm k T n = T n − 1 + T n − 2 ± k
- Worked Example: Additive Sequence with Constant Offset
Find the missing term: 2 , 3 , 6 , 10 , 17 , 28 , ? \text{Find the missing term: } 2,\ 3,\ 6,\ 10,\ 17,\ 28,\ ? Find the missing term: 2 , 3 , 6 , 10 , 17 , 28 , ?
Step 1 (Test simple addition):
- 2 + 3 = 5 ≠ 6 2 + 3 = 5 \neq 6 2 + 3 = 5 = 6 (Target is 5 + 1 5 + 1 5 + 1 )
- 3 + 6 = 9 ≠ 10 3 + 6 = 9 \neq 10 3 + 6 = 9 = 10 (Target is 9 + 1 9 + 1 9 + 1 )
- 6 + 10 = 16 ≠ 17 6 + 10 = 16 \neq 17 6 + 10 = 16 = 17 (Target is 16 + 1 16 + 1 16 + 1 )
- 10 + 17 = 27 ≠ 28 10 + 17 = 27 \neq 28 10 + 17 = 27 = 28 (Target is 27 + 1 27 + 1 27 + 1 )
Step 2 (Establish governing rule): The rule is: sum the previous two terms and add 1 1 1 : T n = T n − 1 + T n − 2 + 1 T_n = T_{n-1} + T_{n-2} + 1 T n = T n − 1 + T n − 2 + 1
Step 3 (Calculate target term): T 7 = 17 + 28 + 1 = 45 + 1 = 46 T_7 = 17 + 28 + 1 = 45 + 1 = 46 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:
Pattern: Op 1 ⟶ Op 2 ⟶ Op 1 ⟶ Op 2 … \text{Pattern: } \text{Op}_1 \longrightarrow \text{Op}_2 \longrightarrow \text{Op}_1 \longrightarrow \text{Op}_2 \dots Pattern: Op 1 ⟶ Op 2 ⟶ Op 1 ⟶ Op 2 …
Common operation pairings include:
- Multiply / Subtract: × 3 \times 3 × 3 , then − 3 -3 − 3 , then × 3 \times 3 × 3 , then − 3 -3 − 3
- Add / Multiply: + 4 +4 + 4 , then × 2 \times 2 × 2 , then + 4 +4 + 4 , then × 2 \times 2 × 2
- Multiply / Divide: × 4 \times 4 × 4 , then ÷ 2 \div 2 ÷ 2 , then × 4 \times 4 × 4 , then ÷ 2 \div 2 ÷ 2
- Worked Example: Alternating Operations
Find the missing term: 4 , 12 , 9 , 27 , 24 , 72 , 69 , ? \text{Find the missing term: } 4,\ 12,\ 9,\ 27,\ 24,\ 72,\ 69,\ ? Find the missing term: 4 , 12 , 9 , 27 , 24 , 72 , 69 , ?
Step 1 (Analyze adjacent transitions):
- 4 → 12 4 \to 12 4 → 12 : Multiply by 3 3 3 ( 4 × 3 = 12 4 \times 3 = 12 4 × 3 = 12 )
- 12 → 9 12 \to 9 12 → 9 : Subtract 3 3 3 ( 12 − 3 = 9 12 - 3 = 9 12 − 3 = 9 )
- 9 → 27 9 \to 27 9 → 27 : Multiply by 3 3 3 ( 9 × 3 = 27 9 \times 3 = 27 9 × 3 = 27 )
- 27 → 24 27 \to 24 27 → 24 : Subtract 3 3 3 ( 27 − 3 = 24 27 - 3 = 24 27 − 3 = 24 )
- 24 → 72 24 \to 72 24 → 72 : Multiply by 3 3 3 ( 24 × 3 = 72 24 \times 3 = 72 24 × 3 = 72 )
- 72 → 69 72 \to 69 72 → 69 : Subtract 3 3 3 ( 72 − 3 = 69 72 - 3 = 69 72 − 3 = 69 )
Step 2 (Determine next operation): The sequence alternates between × 3 \times 3 × 3 and − 3 -3 − 3 . The last step was − 3 -3 − 3 , so the next operation must be × 3 \times 3 × 3 .
Step 3 (Calculate target term): 69 × 3 = 207 69 \times 3 = 207 69 × 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]
Sequence Architecture Primary Visual Clue Mental Diagnostic Test Solving Shortcut
Dual Interleaved (Linear) Saw-tooth zig-zag ( 7 + 7+ 7 + terms) Compare T 1 → T 3 → T 5 T_1 \to T_3 \to T_5 T 1 → T 3 → T 5 Ignore the thread that doesn't include the target index
Dual Interleaved (Mixed) One steady thread, one exploding Check whether odd is linear and even is geometric Solve only the target parity thread
Triple Interleaved 9 9 9 to 12 12 12 terms with repeating motifs Compare T n T_n T n with T n + 3 T_{n+3} T n + 3 Compute target position modulo 3 3 3
Generalised Fibonacci Numbers grow steadily without constant ratio Check if sum of two adjacent terms equals the next Add the final two terms directly
Modified Fibonacci Near-Fibonacci sums with steady discrepancy Check ( T n − 1 + T n − 2 ) − T n (T_{n-1} + T_{n-2}) - T_n ( T n − 1 + T n − 2 ) − T n Add the final two terms and apply the offset k k k
Alternating Operations Rhythmic compression and expansion Write down operators between terms: + a , × b +a, \times b + a , × b Apply the next operator in the alternating cycle
- 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 T_1 T 1 to T 8 T_8 T 8 ) and asks for the next term, you need T 9 T_9 T 9 , which belongs to the odd thread . Rushing students often continue Thread 2 (even) from T 8 T_8 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 3, 28, 7, 24, 11, 20 3 , 28 , 7 , 24 , 11 , 20 , they often begin calculating differences: + 25 , − 21 , + 17 , − 13 , + 9 +25, -21, +17, -13, +9 + 25 , − 21 , + 17 , − 13 , + 9 . While this specific alternating difference series does form an arithmetic pattern (decreasing by 4 4 4 ), solving it this way requires twice as much arithmetic and cognitive load as simply recognizing two arithmetic threads ( 3 , 7 , 11 → + 4 3, 7, 11 \to +4 3 , 7 , 11 → + 4 and 28 , 24 , 20 → − 4 28, 24, 20 \to -4 28 , 24 , 20 → − 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 T_n = T_{n-1} + T_{n-2} 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.