Study guide
7.2 Interleaved, Fibonacci & Pattern Recognition Series
Irish Public Service Numerical Reasoning Test Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Test Overview, Structure & Assessment Strategies
1.1 Test Overview, Structure & Administration 1.2 Pacing, Time Management & Exam Strategies 1.3 Assessment Interfaces, Tabbed Layouts & 'Cannot Say' Logic
2 Chapter 2: Core Arithmetic, Fractions & Decimals
2.1 Order of Operations & Mental Arithmetic Techniques 2.2 Fractions & Rational Numbers in Public Administration 2.3 Decimals, Rounding & Unit Conversions
3 Chapter 3: Percentages, Ratios & Proportions
3.1 Percentage Calculation & Base Identification 3.2 Percentage Change, Reverse Percentages & Multipliers 3.3 Ratios, Partitioning & Proportional Allocation 3.4 Rates, Staffing Metrics & Weighted Averages
4 Chapter 4: Statistical Tables & Bar Charts
4.1 Tabular Data Interpretation & Footnote Traps 4.2 Bar Charts, Clustered Bars & Segmented Stacks 4.3 Histograms & Frequency Distributions in Civil Service Reporting
5 Chapter 5: Line Graphs, Pie Charts & Multi-Source Synthesis
5.1 Line Graphs, Time Series & Trend Analysis 5.2 Pie Charts & Proportional Sector Expenditure 5.3 Multi-Source Data Synthesis & Cross-Referencing
6 Chapter 6: Financial Computations & Public Expenditure
6.1 Public Sector Budgeting, Allocation & Variance Analysis 6.2 Unit Costing, Service Delivery & Economies of Scale 6.3 Taxation, VAT & Net-to-Gross Calculations 6.4 Inflation, Indexation & Real vs Nominal Values
7 Chapter 7: Numerical Series, Sequences & Rapid Estimation
7.1 Arithmetic, Geometric & Two-Stage Number Sequences 7.2 Interleaved, Fibonacci & Pattern Recognition Series 7.3 High-Speed Estimation, Rounding & Order-of-Magnitude Filtering 7.4 Distractor Analysis, Unit Verification & Sanity Checking
7.2 Interleaved, Fibonacci & Pattern Recognition Series
Key Takeaways Explain This Topic AI
Interleaved (dual-track) sequences weave two independent mathematical series across alternating odd and even positions; separating them into distinct tracks immediately clarifies seemingly chaotic oscillations.
Fibonacci-type additive recurrences use the sum of the previous two terms and require specified initial values; different seeds produce different sequences.
Progressive operational series alternate between two operations (such as +a followed by * b) or increment the operational modifier by one at each sequential step (+1, * 2, +3, * 4).
Number grids and matrix arrays should be diagnosed methodically: test horizontal row relationships, vertical column relationships, and linear combinations where the final cell is derived from prior cells.
Last updated: October 2026
7.2 Interleaved, Fibonacci & Pattern Recognition Series
These optional practice patterns extend the arithmetic and geometric models in Section 7.1. They are not a claim about the content of a specific Irish recruitment campaign. Verify a proposed rule against all the supplied terms and use the stated pattern assumptions.
Interleaved (Dual-Track) Alternating Sequences
An interleaved series consists of two (or occasionally three) independent sub-sequences woven together into a single composite sequence.
Structural Mechanics
Track 1 occupies the odd positions ( n = 1 , 3 , 5 , 7 , … n = 1, 3, 5, 7, \dots n = 1 , 3 , 5 , 7 , … ).
Track 2 occupies the even positions ( n = 2 , 4 , 6 , 8 , … n = 2, 4, 6, 8, \dots n = 2 , 4 , 6 , 8 , … ).
Each track operates under its own independent rule (e.g., Track 1 may be an arithmetic progression while Track 2 is geometric or quadratic).
Diagnostic Indicators
An interleaved sequence is strongly indicated when:
The sequence exhibits an oscillating "saw-tooth" profile (e.g., rising, falling, rising, falling).
Adjacent differences fluctuate erratically without any coherent pattern.
Skipping every second number reveals two smooth, predictable progressions.
Systematic Isolation Method
When an oscillating sequence appears, immediately write the numbers in two staggered parallel rows on scratch paper:
Given Series: 18 , 5 , 22 , 10 , 26 , 20 , 30 , ? \text{Given Series: } 18, 5, 22, 10, 26, 20, 30, ? Given Series: 18 , 5 , 22 , 10 , 26 , 20 , 30 , ?
Track 1 (Odd Positions: 1st, 3rd, 5th, 7th) : 18 → 22 → 26 → 30 ( Arithmetic Progression: d = + 4 ) 18 \to 22 \to 26 \to 30 \quad (\text{Arithmetic Progression: } d = +4) 18 → 22 → 26 → 30 ( Arithmetic Progression: d = + 4 )
Track 2 (Even Positions: 2nd, 4th, 6th, 8th) : 5 → 10 → 20 → ? ( Geometric Progression: r = 2 ) 5 \to 10 \to 20 \to ? \quad (\text{Geometric Progression: } r = 2) 5 → 10 → 20 → ? ( Geometric Progression: r = 2 )
The missing term is at position 8 (an even position), which belongs strictly to Track 2: 20 × 2 = 40 20 \times 2 = 40 20 × 2 = 40 .
Important
Always verify which track contains the target blank. In an 8-term sequence, a blank at position 7 requires extending Track 1, whereas a blank at position 8 requires extending Track 2. Mixing up the target track extends the wrong subsequence.
Fibonacci and Additive Recursive Sequences
A recursive definition specifies later terms using earlier terms and initial values. The same sequence may also admit an explicit formula in its index:
- T n = f ( T n − 1 , T n − 2 , … ) T_n = f(T_{n-1}, T_{n-2}, \dots) T n = f ( T n − 1 , T n − 2 , … )
- The Classical Fibonacci Sequence
In the canonical Fibonacci sequence, each term equals the sum of the two immediately preceding terms:
T n = T n − 1 + T n − 2 T_n = T_{n-1} + T_{n-2} T n = T n − 1 + T n − 2 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , … 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, \dots 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , …
Generalized Fibonacci-Type Additive Sequences
The sum-of-previous-two recurrence can start from other seed values. For example:
4 , 7 , 11 , 18 , 29 , 47 , 76 , 123 , … 4, 7, 11, 18, 29, 47, 76, 123, \dots 4 , 7 , 11 , 18 , 29 , 47 , 76 , 123 , …
Verification: 4 + 7 = 11 , 7 + 11 = 18 , 11 + 18 = 29 , 18 + 29 = 47 , 29 + 47 = 76 \text{Verification: } 4 + 7 = 11, \quad 7 + 11 = 18, \quad 11 + 18 = 29, \quad 18 + 29 = 47, \quad 29 + 47 = 76 Verification: 4 + 7 = 11 , 7 + 11 = 18 , 11 + 18 = 29 , 18 + 29 = 47 , 29 + 47 = 76
Multi-Term and Weighted Variations
Tribonacci Sequences : Each term equals the sum of the previous three 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 ): 1 , 2 , 4 , 7 , 13 , 24 , 44 , 81 , ⋯ ⟹ 7 + 13 + 24 = 44 1, 2, 4, 7, 13, 24, 44, 81, \dots \implies 7 + 13 + 24 = 44 1 , 2 , 4 , 7 , 13 , 24 , 44 , 81 , ⋯ ⟹ 7 + 13 + 24 = 44
Weighted or Affine Recurrences : A rule can scale earlier terms and add another term or a constant: T n = 2 T n − 1 + T n − 2 or T n = 2 T n − 1 − 1 T_n = 2T_{n-1} + T_{n-2} \quad \text{or} \quad T_n = 2T_{n-1} - 1 T n = 2 T n − 1 + T n − 2 or T n = 2 T n − 1 − 1 For example, 3 , 5 , 9 , 17 , 33 , 65 3, 5, 9, 17, 33, 65 3 , 5 , 9 , 17 , 33 , 65 corresponds to T n = 2 T n − 1 − 1 T_n = 2T_{n-1} - 1 T n = 2 T n − 1 − 1 , which also produces first differences that double ( 2 , 4 , 8 , 16 , 32 2, 4, 8, 16, 32 2 , 4 , 8 , 16 , 32 ).
Progressive Operations and Alternating Operators
Another frequent structure involves sequences governed by cycling mathematical operations rather than a static difference.
Fixed Alternating Operators
The sequence alternates between two distinct operations applied in repeating turns:
5 → + 4 9 → × 2 18 → + 4 22 → × 2 44 → + 4 48 → × 2 96 5 \xrightarrow{+4} 9 \xrightarrow{\times 2} 18 \xrightarrow{+4} 22 \xrightarrow{\times 2} 44 \xrightarrow{+4} 48 \xrightarrow{\times 2} 96 5 + 4 9 × 2 18 + 4 22 × 2 44 + 4 48 × 2 96
Here, the operational sequence is strictly [ + 4 , × 2 , + 4 , × 2 , + 4 , × 2 ] [+4, \times 2, +4, \times 2, +4, \times 2] [ + 4 , × 2 , + 4 , × 2 , + 4 , × 2 ] .
Expanding Operands (Index-Linked Steps)
Both the operation and the operand change progressively at each transition:
2 → + 1 3 → × 2 6 → + 3 9 → × 4 36 → + 5 41 → × 6 246 2 \xrightarrow{+1} 3 \xrightarrow{\times 2} 6 \xrightarrow{+3} 9 \xrightarrow{\times 4} 36 \xrightarrow{+5} 41 \xrightarrow{\times 6} 246 2 + 1 3 × 2 6 + 3 9 × 4 36 + 5 41 × 6 246
Notice that the operation alternates between addition and multiplication, while the operand increments by 1 at every step ( + 1 , × 2 , + 3 , × 4 , + 5 , × 6 +1, \times 2, +3, \times 4, +5, \times 6 + 1 , × 2 , + 3 , × 4 , + 5 , × 6 ).
Prime Number Step Progressions
In some items, differences advance through sequential prime numbers:
10 → + 2 12 → + 3 15 → + 5 20 → + 7 27 → + 11 38 → + 13 51 10 \xrightarrow{+2} 12 \xrightarrow{+3} 15 \xrightarrow{+5} 20 \xrightarrow{+7} 27 \xrightarrow{+11} 38 \xrightarrow{+13} 51 10 + 2 12 + 3 15 + 5 20 + 7 27 + 11 38 + 13 51
Candidates frequently misidentify the pattern as "consecutive odd numbers" and incorrectly add 9 after 7 instead of 11. Remembering that 9 and 15 are composite numbers prevents this error.
Visual Number Grids and Matrix Arrays
The hypothetical matrix exercise below applies a stated row-rule family. It is optional pattern practice, not a description of Aon’s published numerical statement format or of a specific publicjobs campaign.
Standard Matrix Solving Protocol
When presented with a 3 × 3 3 \times 3 3 × 3 number matrix, systematically test these three hypotheses in order:
Horizontal Row Transformation : Check if Cell 3 in each row is a function of Cell 1 and Cell 2: C 3 = ( C 1 + C 2 ) × k or C 3 = C 1 × C 2 − k C_3 = (C_1 + C_2) \times k \quad \text{or} \quad C_3 = C_1 \times C_2 - k C 3 = ( C 1 + C 2 ) × k or C 3 = C 1 × C 2 − k
Uniform Line Sums : Check if the sum of each row (or each column) equals a uniform constant: Row 1 Sum = Row 2 Sum = Row 3 Sum = K \text{Row}_1 \text{ Sum} = \text{Row}_2 \text{ Sum} = \text{Row}_3 \text{ Sum} = K Row 1 Sum = Row 2 Sum = Row 3 Sum = K
Vertical Column Transformation : Check if the bottom cell in each column is derived from the upper cells: R 3 = f ( R 1 , R 2 ) R_3 = f(R_1, R_2) R 3 = f ( R 1 , R 2 )
Matrix Demonstration Case Study
Consider the matrix display:
- Grid Row Column 1 Column 2 Column 3
- Row 1 8 13 42
- Row 2 12 17 58
Row 3 15 21 ?
Row 1: ( 8 + 13 ) × 2 = 21 × 2 = 42 (8 + 13) \times 2 = 21 \times 2 = 42 ( 8 + 13 ) × 2 = 21 × 2 = 42 .
Row 2: ( 12 + 17 ) × 2 = 29 × 2 = 58 (12 + 17) \times 2 = 29 \times 2 = 58 ( 12 + 17 ) × 2 = 29 × 2 = 58 .
Row 3: ( 15 + 21 ) × 2 = 36 × 2 = 72 (15 + 21) \times 2 = 36 \times 2 = 72 ( 15 + 21 ) × 2 = 36 × 2 = 72 .
The missing number is 72 .
Complex Series Taxonomy & Diagnostic Reference
The following table summarizes complex series models, their structural signatures, and quick decoding rules:
Series Archetype Structural Mechanism Visual Signature Decoding Strategy
Interleaved Dual-Track Two series woven across odd/even indices Saw-tooth oscillation; erratic adjacent differences Split into Track 1 (odd) and Track 2 (even) on scratch paper
Generalised Additive Recursive T n = T n − 1 + T n − 2 T_n = T_{n-1} + T_{n-2} T n = T n − 1 + T n − 2 Accelerating sums; adjacent pairs sum to subsequent term Test whether T 1 + T 2 = T 3 T_1 + T_2 = T_3 T 1 + T 2 = T 3 , T 2 + T 3 = T 4 T_2 + T_3 = T_4 T 2 + T 3 = T 4
Tribonacci Recursive 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 Rapid growth; sum of three preceding values Check sum of first three terms against fourth term
Alternating Operations Operations cycle (e.g., + a , × b , + a , × b +a, \times b, +a, \times b + a , × b , + a , × b ) Regular pattern of alternating small and large jumps Map operators above the sequence line by line
Expanding Operands Operand increments at each step ( + 1 , × 2 , + 3 , × 4 +1, \times 2, +3, \times 4 + 1 , × 2 , + 3 , × 4 ) Step sizes grow by + 1 +1 + 1 while operations cycle Track operator type and operand magnitude separately
Prime Increment Step sizes are consecutive prime numbers + 2 , + 3 , + 5 , + 7 , + 11 , + 13 +2, +3, +5, +7, +11, +13 + 2 , + 3 , + 5 , + 7 , + 11 , + 13 Check whether differences skip 9 and 15
Number Matrix ( 3 × 3 3 \times 3 3 × 3 ) Row/column formula or constant line sum 2D tabular array with one missing value Test row sums, column sums, then C 3 = f ( C 1 , C 2 ) C_3 = f(C_1, C_2) C 3 = f ( C 1 , C 2 )
Tip
If an alternating sequence has 7 or 8 terms, count the total terms before starting. If there are 7 terms and term 8 is blank, you only need to decode Track 2. Once the independent two-track structure is established, focus the continuation on the target track. Check enough terms in both tracks to avoid selecting a convenient but unsupported model.