Study guide

5.1 Number Sequences & Alphanumeric Patterns

Ghana Armed Forces Recruit Aptitude Test GAF-RAT

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: GAF Recruitment Architecture & Exam Strategy

1.1 GAF Recruitment Process, Eligibility & Selection Phases 1.2 What the Aptitude Test Measures & How to Prepare

2 Chapter 2: English Language & Verbal Reasoning

2.1 Spelling Conventions & High-Frequency Confusables 2.2 English Grammar, Syntax & Sentence Correction 2.3 Vocabulary, Synonyms & Antonyms in Context 2.4 Reading Comprehension & Factual Inference

3 Chapter 3: Numerical Operations & Everyday Arithmetic

3.1 Mental Arithmetic, Order of Operations, Integers & Number Properties 3.2 Fractions, Decimals & Percentages 3.3 Ratios, Proportions & Practical Rates

4 Chapter 4: Applied Quantitative Problem Solving

4.1 Elementary Algebra & Linear Equations 4.2 Plane Geometry, Perimeter, Area & Mensuration 4.3 Everyday Word Problems: Money, Time, Ages, Averages & Units

5 Chapter 5: Logical & Abstract Reasoning

5.1 Number Sequences & Alphanumeric Patterns 5.2 Coding, Decoding & Rule-Based Substitution 5.3 Abstract Spatial Reasoning & Non-Verbal Matrices 5.4 Formal Deductions, Syllogisms & Venn Logic

6 Chapter 6: Ghanaian Geography, History & Governance

6.1 Geography, Natural Resources & Administrative Regions of Ghana 6.2 Modern History, Independence Milestones & National Symbols 6.3 Constitution, Civic Institutions & Arms of Government

7 Chapter 7: Ghana Armed Forces Structure, Ranks, Defence & Current Affairs

7.1 GAF Command Structure, Service Branches & International Missions 7.2 Military Rank Structure: Army, Navy and Air Force 7.3 Current Affairs & National Leadership Checkpoints (2025–2026)

5.1 Number Sequences & Alphanumeric Patterns

Key Takeaways Explain This Topic AI

Number sequence questions on reasoning tests assess systematic progression mechanisms: arithmetic progressions with constant differences, geometric progressions with constant ratios, and multi-tier polynomial differences.

Non-linear series frequently utilize power functions ( n 2 , n 3 , n 2 ± 1 n^2, n^3, n^2 \pm 1 n 2 , n 3 , n 2 ± 1 ) or cumulative Fibonacci structures where successive terms equal the sum of preceding terms.

Alphanumeric sequences merge numerical progressions with the 26-letter alphabetic system, using forward positions ( A = 1 A=1 A = 1 to Z = 26 Z=26 Z = 26 ), reverse positions ( Z = 1 Z=1 Z = 1 to A = 26 A=26 A = 26 ), or cyclic skip intervals.

Executing a structured 30-second diagnostic routine—evaluating rate of growth, computing first- and second-tier differences, and testing alternating positions—reliably identifies governing patterns without computational delay.

Last updated: October 2026

5.1 Number Sequences & Alphanumeric Patterns

Logical sequence recognition is a standard component of reasoning tests such as the Ghana Armed Forces (GAF) Recruit Aptitude Test, which GAF says measures basic logical reasoning. Number and letter series items evaluate a candidate's fluid intelligence, inductive reasoning, and numerical fluency under compressed testing conditions. In military operations, personnel routinely interact with logistical serial numbers, radio frequencies, grid coordinate progressions, and timed synchronization protocols. These items do not require advanced mathematics; rather, they assess whether a recruit can observe an ordered array of symbols, rapidly deduce the governing generative rule, and extrapolate the next logical elements with zero computational error.

Core Numerical Series Classifications

Every well-formed sequence question is governed by a consistent mathematical transformation linking successive terms. Recognizing the family to which a sequence belongs is the first step toward determining the missing value.

1. Arithmetic Progressions (Constant Difference)

An arithmetic progression is formed when each term after the first is obtained by adding or subtracting a fixed constant, known as the common difference ( d d d ): T n = T n − 1 + d T_n = T_{n-1} + d T n ​ = T n − 1 ​ + d

Positive Difference: The sequence grows at a steady, linear rate. For example, in the series 7 , 12 , 17 , 22 , 27 , … 7, 12, 17, 22, 27, \dots 7 , 12 , 17 , 22 , 27 , … , the difference between adjacent terms is uniformly + 5 +5 + 5 . The next term is 27 + 5 = 32 27 + 5 = 32 27 + 5 = 32 .

Negative Difference: The values decrease steadily. In the series 84 , 76 , 68 , 60 , 52 , … 84, 76, 68, 60, 52, \dots 84 , 76 , 68 , 60 , 52 , … , each step subtracts 8 ( d = − 8 d = -8 d = − 8 ), making the next term 52 − 8 = 44 52 - 8 = 44 52 − 8 = 44 .

Fractional / Decimal Difference: Arithmetic steps can involve simple decimals or fractions, such as 1.5 , 3.0 , 4.5 , 6.0 , … 1.5, 3.0, 4.5, 6.0, \dots 1.5 , 3.0 , 4.5 , 6.0 , … ( d = + 1.5 d = +1.5 d = + 1.5 ).

2. Geometric Progressions (Constant Ratio)

A geometric progression occurs when each term is multiplied or divided by a constant factor, termed the common ratio ( r r r ): T n = T n − 1 × r T_n = T_{n-1} \times r T n ​ = T n − 1 ​ × r

Integer Multipliers: When r > 1 r > 1 r > 1 , numbers escalate rapidly. In the sequence 3 , 6 , 12 , 24 , 48 , … 3, 6, 12, 24, 48, \dots 3 , 6 , 12 , 24 , 48 , … , each term doubles ( r = 2 r = 2 r = 2 ), leading to 48 × 2 = 96 48 \times 2 = 96 48 × 2 = 96 .

Fractional Multipliers (Division): When 0 < r < 1 0 < r < 1 0 < r < 1 , the terms diminish proportionally. In 160 , 80 , 40 , 20 , 10 , … 160, 80, 40, 20, 10, \dots 160 , 80 , 40 , 20 , 10 , … , each value is halved ( r = 0.5 r = 0.5 r = 0.5 ), yielding a subsequent value of 5.

Alternating Signs: If the common ratio is negative, terms alternate between positive and negative values. For example, 3 , − 6 , 12 , − 24 , 48 , … 3, -6, 12, -24, 48, \dots 3 , − 6 , 12 , − 24 , 48 , … ( r = − 2 r = -2 r = − 2 ).

3. Two-Tier and Multi-Tier Differences (Polynomial Progressions)

When the differences between consecutive terms are not constant, computing the differences between those differences (the second-tier difference) often uncovers an underlying arithmetic pattern.

Consider the series: 2 , 5 , 10 , 17 , 26 , … 2, 5, 10, 17, 26, \dots 2 , 5 , 10 , 17 , 26 , …

First-Tier Differences:

  • 5 − 2 = 3 5 - 2 = 3 5 − 2 = 3
  • 10 − 5 = 5 10 - 5 = 5 10 − 5 = 5
  • 17 − 10 = 7 17 - 10 = 7 17 − 10 = 7
  • 26 − 17 = 9 26 - 17 = 9 26 − 17 = 9

Second-Tier Differences:

The first-tier differences are 3 , 5 , 7 , 9 3, 5, 7, 9 3 , 5 , 7 , 9 , which form an arithmetic sequence with a constant difference of + 2 +2 + 2 .

Extrapolation: The next difference must be 9 + 2 = 11 9 + 2 = 11 9 + 2 = 11 . Adding this difference to the last known term yields 26 + 11 = 37 26 + 11 = 37 26 + 11 = 37 .

Whenever a sequence grows non-linearly but lacks a simple multiplicative ratio, finding first and second differences is the most reliable analytical technique.

4. Interleaved and Alternating Sequences

Examiners frequently combine two separate sequences into a single question by interleaving their terms. The odd-positioned terms follow one progression, while the even-positioned terms follow a completely independent rule.

Consider the sequence: 14 , 28 , 16 , 25 , 18 , 22 , 20 , … 14, 28, 16, 25, 18, 22, 20, \dots 14 , 28 , 16 , 25 , 18 , 22 , 20 , …

Odd-Indexed Positions ( T 1 , T 3 , T 5 , T 7 T_1, T_3, T_5, T_7 T 1 ​ , T 3 ​ , T 5 ​ , T 7 ​ ): 14 , 16 , 18 , 20 , … 14, 16, 18, 20, \dots 14 , 16 , 18 , 20 , … (Arithmetic progression with d = + 2 d = +2 d = + 2 ).

Even-Indexed Positions ( T 2 , T 4 , T 6 T_2, T_4, T_6 T 2 ​ , T 4 ​ , T 6 ​ ): 28 , 25 , 22 , … 28, 25, 22, \dots 28 , 25 , 22 , … (Arithmetic progression with d = − 3 d = -3 d = − 3 ).

To find the next term ( T 8 T_8 T 8 ​ ), observe that it occupies an even position. Continuing the even sub-series: 22 − 3 = 19 22 - 3 = 19 22 − 3 = 19 . Interleaved series are immediately signaled when numbers oscillate unpredictably between increasing and decreasing values.

Exponential, Power & Fibonacci Sequences

High-scoring aptitude candidates memorize benchmark squares and cubes to recognize power-based series on sight.

Square Sequences ( n 2 n^2 n 2 ) and Modified Squares ( n 2 ± k n^2 \pm k n 2 ± k )

Standard square values must be recognized instantly, at least through 12 2 12^2 1 2 2 :

  • n n n n 2 n^2 n 2 n 2 − 1 n^2 - 1 n 2 − 1 n 2 + 1 n^2 + 1 n 2 + 1
  • 1 1 0 2
  • 2 4 3 5
  • 3 9 8 10
  • 4 16 15 17
  • 5 25 24 26
  • 6 36 35 37
  • 7 49 48 50
  • 8 64 63 65
  • 9 81 80 82
  • 10 100 99 101
  • 11 121 120 122
  • 12 144 143 145

If presented with the sequence 0 , 3 , 8 , 15 , 24 , … 0, 3, 8, 15, 24, \dots 0 , 3 , 8 , 15 , 24 , … , recognizing each value as ( n 2 − 1 ) (n^2 - 1) ( n 2 − 1 ) immediately reveals the next term: 6 2 − 1 = 35 6^2 - 1 = 35 6 2 − 1 = 35 .

Cube Sequences ( n 3 n^3 n 3 ) and Cube Modifications

Cubes generate rapid numerical expansion. Memorize the baseline cubes through 6:

  • 1 3 = 1 1^3 = 1 1 3 = 1
  • 2 3 = 8 2^3 = 8 2 3 = 8
  • 3 3 = 27 3^3 = 27 3 3 = 27
  • 4 3 = 64 4^3 = 64 4 3 = 64
  • 5 3 = 125 5^3 = 125 5 3 = 125
  • 6 3 = 216 6^3 = 216 6 3 = 216

A series such as 2 , 9 , 28 , 65 , 126 , … 2, 9, 28, 65, 126, \dots 2 , 9 , 28 , 65 , 126 , … represents the rule ( n 3 + 1 ) (n^3 + 1) ( n 3 + 1 ) . The subsequent value is 6 3 + 1 = 217 6^3 + 1 = 217 6 3 + 1 = 217 .

Fibonacci and Cumulative Additive Sequences

In a Fibonacci sequence, each term is the sum of the two 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 ​

Standard Fibonacci: 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , … 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, \dots 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , …

Non-Standard Bases (Lucas Variants): The starting values may differ while maintaining cumulative addition. For example: 3 , 4 , 7 , 11 , 18 , 29 , … 3, 4, 7, 11, 18, 29, \dots 3 , 4 , 7 , 11 , 18 , 29 , … Here, 3 + 4 = 7 3 + 4 = 7 3 + 4 = 7 ; 4 + 7 = 11 4 + 7 = 11 4 + 7 = 11 ; 7 + 11 = 18 7 + 11 = 18 7 + 11 = 18 ; 11 + 18 = 29 11 + 18 = 29 11 + 18 = 29 . The next term is 18 + 29 = 47 18 + 29 = 47 18 + 29 = 47 .

Alphabetical & Alphanumeric Hybrid Sequences

Letter series require mapping English alphabetic characters to integer positions.

Alphabetical Numerical Systems

Forward Position System ( A = 1 A=1 A = 1 to Z = 26 Z=26 Z = 26 ):

To recall positions without reciting the entire alphabet, use the standard memory anchor EJOTY , which corresponds to multiples of five:

E = 5 , J = 10 , O = 15 , T = 20 , Y = 25 .

Any letter can be referenced relative to the nearest anchor (e.g., M M M is two positions before O O O , so 15 − 2 = 13 15 - 2 = 13 15 − 2 = 13 ).

Reverse Position System ( Z = 1 Z=1 Z = 1 to A = 26 A=26 A = 26 ):

Reverse position is calculated using the Rule of 27 : Reverse Position = 27 − Forward Position \text{Reverse Position} = 27 - \text{Forward Position} Reverse Position = 27 − Forward Position

For example, the reverse position of D D D (Forward = 4) is 27 − 4 = 23 27 - 4 = 23 27 − 4 = 23 .

Letter Skip Patterns

Letter series apply arithmetic difference rules to alphabetic indices:

Uniform Skip: B ( 2 ) , E ( 5 ) , H ( 8 ) , K ( 11 ) , … B(2), E(5), H(8), K(11), \dots B ( 2 ) , E ( 5 ) , H ( 8 ) , K ( 11 ) , … Each step advances by + 3 +3 + 3 positions, so the next letter is 11 + 3 = 14 11 + 3 = 14 11 + 3 = 14 ( N N N ).

Expanding Skip: A ( 1 ) , C ( 3 ) , F ( 6 ) , J ( 10 ) , O ( 15 ) , … A(1), C(3), F(6), J(10), O(15), \dots A ( 1 ) , C ( 3 ) , F ( 6 ) , J ( 10 ) , O ( 15 ) , … The differences expand sequentially: + 2 , + 3 , + 4 , + 5 +2, +3, +4, +5 + 2 , + 3 , + 4 , + 5 . The next skip must be + 6 +6 + 6 , giving position 15 + 6 = 21 15 + 6 = 21 15 + 6 = 21 ( U U U ).

Alphanumeric Hybrids

Alphanumeric items combine letters and numbers. To solve them, treat the letter track and the number track as two completely separate concurrent series.

  • Note
  • Consider the hybrid sequence: B 2 , D 4 , F 8 , H 16 , … B2, D4, F8, H16, \dots B 2 , D 4 , F 8 , H 16 , …

Letter Component: B ( 2 ) , D ( 4 ) , F ( 6 ) , H ( 8 ) … B(2), D(4), F(6), H(8) \dots B ( 2 ) , D ( 4 ) , F ( 6 ) , H ( 8 ) … Advances by + 2 +2 + 2 positions. The next letter is J ( 10 ) J(10) J ( 10 ) .

Numeric Component: 2 , 4 , 8 , 16 , … 2, 4, 8, 16, \dots 2 , 4 , 8 , 16 , … Doubles at each step ( r = 2 r = 2 r = 2 ). The next number is 16 × 2 = 32 16 \times 2 = 32 16 × 2 = 32 .

Synthesized Term: Combining both tracks produces J 32 J32 J 32 .

The 30-Second Diagnostic Triage Protocol

In timed practice, spending more than about 40 seconds on any single sequence item harms time management. Follow this systematic 5-step triage: [Step 1: Assess Growth Rate]

  • ├─ Slow & steady? ───────► Calculate First-Tier Differences (Arithmetic)
  • ├─ Explosive / Steep? ───► Check Ratios (Geometric) or Power Benchmarks (n², n³)
  • └─ Oscillating Up/Down? ──► Test Alternating / Interleaved Positions
  • [Step 2: Inspect First Differences]
  • ├─ Constant value? ──────► Apply common difference
  • └─ Changing steadily? ───► Compute Second-Tier Differences
  • [Step 3: Test Special Cases]
  • ├─ Each term ≈ sum of prior two? ──► Fibonacci rule
  • └─ Mixed letters & digits? ────────► Separate tracks completely
  • Diagnostic Summary Table

Sequence Classification Defining Visual Cue Diagnostic Operation Benchmark Example

Arithmetic Progression Gradual, uniform growth or reduction Compute T 2 − T 1 T_2 - T_1 T 2 ​ − T 1 ​ and T 3 − T 2 T_3 - T_2 T 3 ​ − T 2 ​ 13 , 19 , 25 , 31 , … 13, 19, 25, 31, \dots 13 , 19 , 25 , 31 , … ( d = + 6 d = +6 d = + 6 )

Geometric Progression Steep growth; constant multiplier Compute T 2 ÷ T 1 T_2 \div T_1 T 2 ​ ÷ T 1 ​ and T 3 ÷ T 2 T_3 \div T_2 T 3 ​ ÷ T 2 ​ 5 , 15 , 45 , 135 , … 5, 15, 45, 135, \dots 5 , 15 , 45 , 135 , … ( r = 3 r = 3 r = 3 )

Two-Tier Polynomial Non-uniform growth; constant acceleration Compute second differences 3 , 6 , 11 , 18 , 27 , … 3, 6, 11, 18, 27, \dots 3 , 6 , 11 , 18 , 27 , … ( d 2 = + 2 d_2 = +2 d 2 ​ = + 2 )

Modified Square Values cluster near perfect squares Compare to n 2 n^2 n 2 : test n 2 ± 1 n^2 \pm 1 n 2 ± 1 or n 2 ± k n^2 \pm k n 2 ± k 3 , 8 , 15 , 24 , 35 , … 3, 8, 15, 24, 35, \dots 3 , 8 , 15 , 24 , 35 , … ( n 2 − 1 n^2 - 1 n 2 − 1 )

Interleaved / Alternating Oscillating values (up, down, up) Split into odd and even index lists 5 , 20 , 8 , 16 , 11 , 12 , … 5, 20, 8, 16, 11, 12, \dots 5 , 20 , 8 , 16 , 11 , 12 , …

Cumulative Additive Terms roughly equal sum of prior terms Test if T n = T n − 1 + T n − 2 T_n = T_{n-1} + T_{n-2} T n ​ = T n − 1 ​ + T n − 2 ​ 2 , 3 , 5 , 8 , 13 , 21 , … 2, 3, 5, 8, 13, 21, \dots 2 , 3 , 5 , 8 , 13 , 21 , …

Alphanumeric Hybrid Letter-digit paired tokens Decouple alphabetic and numeric rules A 1 , C 4 , E 9 , G 16 , … A1, C4, E9, G16, \dots A 1 , C 4 , E 9 , G 16 , … ( I 25 I25 I 25 )