Study guide

2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri)

TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy

1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing

2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic

2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators

3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out

3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)

4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic

4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections

6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic

6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings

7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic

7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals

8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)

9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities

9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)

10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems

10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems

11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics

11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas

12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus

12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment

13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons

13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares

14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry

14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles

2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri)

Key Takeaways Explain This Topic AI

First-order arithmetic series have a constant difference Δ₁ = d, while second-order quadratic series have an arithmetic first difference and a constant second difference Δ₂ = 2A

Mixed multiplicative-additive progressions follow aₙ₊₁ = r · aₙ ± k and are diagnosed when consecutive terms grow roughly by a constant ratio r with a small offset

Interleaved (dual/alternating) series combine two independent rules on odd indices (a₁, a₃, a₅, ...) and even indices (a₂, a₄, a₆, ...), signaled by 7+ given terms or oscillating values

Non-standard sequences include shifted powers (n² ± 1, n³ ± 1), consecutive primes, factorials, Fibonacci-type recursions, and self-referential digit-sum progressions

Last updated: October 2026

Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri)

Practice Strategy: Number-series exercises build numerical pattern recognition. Check a proposed rule against every supplied transition, then compare the options. Record your own solving times instead of assuming these items occupy a fixed opening position or take a fixed number of seconds.

A Sayı Dizisi presents a finite sequence of numbers—typically 5 to 9 terms—governed by a deterministic generation law, asking you to determine the missing term ( ? ? ? ) or a pair of missing terms. Read the instruction and any stated rule restrictions; do not assume that every sequence is presented without verbal information.

The Five Core Archetypes of TR-YÖS Number Series

The following five families are a practical checklist, not an exhaustive classification. A finite list can fit multiple rules; use the stated constraints and the simplest rule consistent with all supplied terms.

1. First- and Second-Order Arithmetic Difference Series ( Fark Dizileri )

When terms grow or shrink gradually at a steady or smoothly accelerating pace, write the first differences ( Δ 1 = a n + 1 − a n \Delta_1 = a_{n+1} - a_n Δ 1 ​ = a n + 1 ​ − a n ​ ) directly beneath the sequence.

First-Order Arithmetic Series ( Δ 1 = d \Delta_1 = d Δ 1 ​ = d ): The difference between consecutive terms is constant. The general term is linear: a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n ​ = a 1 ​ + ( n − 1 ) d

Second-Order Quadratic Series ( Δ 2 = c \Delta_2 = c Δ 2 ​ = c ): The first differences themselves form an arithmetic progression ( Δ 1 \Delta_1 Δ 1 ​ increases or decreases by a constant c c c ). The sequence is governed by a quadratic polynomial: a n = A n 2 + B n + C where Δ 2 = 2 A a_n = An^2 + Bn + C \quad \text{where } \Delta_2 = 2A a n ​ = A n 2 + B n + C where Δ 2 ​ = 2 A

Two classic special cases appear repeatedly:

Triangular Numbers ( Üçgensel Sayılar ): T n = n ( n + 1 ) 2 ⟹ 1 , 3 , 6 , 10 , 15 , 21 , 28 , 36 , … T_n = \frac{n(n+1)}{2} \implies 1, 3, 6, 10, 15, 21, 28, 36, \dots T n ​ = 2 n ( n + 1 ) ​ ⟹ 1 , 3 , 6 , 10 , 15 , 21 , 28 , 36 , … ( Δ 1 = + 2 , + 3 , + 4 , + 5 , … \Delta_1 = +2, +3, +4, +5, \dots Δ 1 ​ = + 2 , + 3 , + 4 , + 5 , … )

Pronic Numbers ( Ardışık Çarpım Sayıları ): P n = n ( n + 1 ) ⟹ 2 , 6 , 12 , 20 , 30 , 42 , 56 , … P_n = n(n+1) \implies 2, 6, 12, 20, 30, 42, 56, \dots P n ​ = n ( n + 1 ) ⟹ 2 , 6 , 12 , 20 , 30 , 42 , 56 , … ( Δ 1 = + 4 , + 6 , + 8 , + 10 , … \Delta_1 = +4, +6, +8, +10, \dots Δ 1 ​ = + 4 , + 6 , + 8 , + 10 , … )

Worked Example 1: Second-Order Difference Series

Find the next term in the sequence: 4 , 7 , 12 , 19 , 28 , 39 , ? 4, 7, 12, 19, 28, 39, ? 4 , 7 , 12 , 19 , 28 , 39 , ?

Compute first differences ( Δ 1 \Delta_1 Δ 1 ​ ): 7 − 4 = + 3 , 12 − 7 = + 5 , 19 − 12 = + 7 , 28 − 19 = + 9 , 39 − 28 = + 11 7 - 4 = +3, \quad 12 - 7 = +5, \quad 19 - 12 = +7, \quad 28 - 19 = +9, \quad 39 - 28 = +11 7 − 4 = + 3 , 12 − 7 = + 5 , 19 − 12 = + 7 , 28 − 19 = + 9 , 39 − 28 = + 11

Compute second differences ( Δ 2 \Delta_2 Δ 2 ​ ): Each consecutive difference increases by + 2 +2 + 2 (the odd integers + 3 , + 5 , + 7 , + 9 , + 11 +3, +5, +7, +9, +11 + 3 , + 5 , + 7 , + 9 , + 11 ).

Extrapolate: The next first difference is 11 + 2 = + 13 11 + 2 = +13 11 + 2 = + 13 . Therefore: ? = 39 + 13 = 52 ? = 39 + 13 = 52 ? = 39 + 13 = 52

(Algebraic check: a n = n 2 + 3 a_n = n^2 + 3 a n ​ = n 2 + 3 for n = 1 , 2 , … , 7 n = 1, 2, \dots, 7 n = 1 , 2 , … , 7 , giving 7 2 + 3 = 52 7^2 + 3 = 52 7 2 + 3 = 52 .)

2. Geometric & Mixed Multiplicative-Additive Series ( Kat ve Eklemeli Diziler )

When terms grow rapidly—doubling or tripling at each step—first differences grow exponentially. Instead of pure subtraction, test a multiplicative-additive recurrence of the form: a n + 1 = r ⋅ a n ± k a_{n+1} = r \cdot a_n \pm k a n + 1 ​ = r ⋅ a n ​ ± k

or an alternating two-operator cycle (such as × r \times r × r followed by + k + k + k , repeated).

Constant Multiplier with Fixed Offset: In 3 , 7 , 15 , 31 , 63 , ? 3, 7, 15, 31, 63, ? 3 , 7 , 15 , 31 , 63 , ? , each term is a n + 1 = 2 a n + 1 a_{n+1} = 2a_n + 1 a n + 1 ​ = 2 a n ​ + 1 , so the next term is 2 ( 63 ) + 1 = 127 2(63) + 1 = 127 2 ( 63 ) + 1 = 127 . Notice that the first differences ( + 4 , + 8 , + 16 , + 32 +4, +8, +16, +32 + 4 , + 8 , + 16 , + 32 ) double at every step—a guaranteed mathematical signature of a × 2 ± k \times 2 \pm k × 2 ± k recurrence.

Constant Multiplier with Negative Offset: In 2 , 5 , 14 , 41 , 122 , ? 2, 5, 14, 41, 122, ? 2 , 5 , 14 , 41 , 122 , ? , each term follows a n + 1 = 3 a n − 1 a_{n+1} = 3a_n - 1 a n + 1 ​ = 3 a n ​ − 1 (or equivalently, first differences are + 3 , + 9 , + 27 , + 81 +3, +9, +27, +81 + 3 , + 9 , + 27 , + 81 ). The next difference is + 243 +243 + 243 , giving 122 + 243 = 365 122 + 243 = 365 122 + 243 = 365 .

Two-Step Operator Cycle: In 4 , 8 , 11 , 22 , 25 , 50 , 53 , ? 4, 8, 11, 22, 25, 50, 53, ? 4 , 8 , 11 , 22 , 25 , 50 , 53 , ? , the operators alternate strictly between × 2 \times 2 × 2 and + 3 +3 + 3 : 4 → × 2 8 → + 3 11 → × 2 22 → + 3 25 → × 2 50 → + 3 53 → × 2 106 4 \xrightarrow{\times 2} 8 \xrightarrow{+3} 11 \xrightarrow{\times 2} 22 \xrightarrow{+3} 25 \xrightarrow{\times 2} 50 \xrightarrow{+3} 53 \xrightarrow{\times 2} 106 4 × 2 ​ 8 + 3 ​ 11 × 2 ​ 22 + 3 ​ 25 × 2 ​ 50 + 3 ​ 53 × 2 ​ 106

3. Interleaved / Alternating Dual Series ( İkili / Atlama Dizileri )

Whenever a sequence oscillates up and down or contains 7 or more given terms , suspect an interleaved dual series immediately. Two independent sub-sequences occupy the odd positions ( a 1 , a 3 , a 5 , a 7 , … a_1, a_3, a_5, a_7, \dots a 1 ​ , a 3 ​ , a 5 ​ , a 7 ​ , … ) and the even positions ( a 2 , a 4 , a 6 , a 8 , … a_2, a_4, a_6, a_8, \dots a 2 ​ , a 4 ​ , a 6 ​ , a 8 ​ , … ).

Worked Example 2: Interleaved Dual Series

Find the pair ( x , y ) (x, y) ( x , y ) that continues the sequence: 5 , 20 , 8 , 16 , 11 , 12 , 14 , 8 , x , y 5, 20, 8, 16, 11, 12, 14, 8, x, y 5 , 20 , 8 , 16 , 11 , 12 , 14 , 8 , x , y

Extract Odd-Indexed Terms ( a 1 , a 3 , a 5 , a 7 , a 9 a_1, a_3, a_5, a_7, a_9 a 1 ​ , a 3 ​ , a 5 ​ , a 7 ​ , a 9 ​ ): 5 → + 3 8 → + 3 11 → + 3 14 → + 3 x = 17 5 \xrightarrow{+3} 8 \xrightarrow{+3} 11 \xrightarrow{+3} 14 \xrightarrow{+3} x = 17 5 + 3 ​ 8 + 3 ​ 11 + 3 ​ 14 + 3 ​ x = 17

Extract Even-Indexed Terms ( a 2 , a 4 , a 6 , a 8 , a 10 a_2, a_4, a_6, a_8, a_{10} a 2 ​ , a 4 ​ , a 6 ​ , a 8 ​ , a 10 ​ ): 20 → − 4 16 → − 4 12 → − 4 8 → − 4 y = 4 20 \xrightarrow{-4} 16 \xrightarrow{-4} 12 \xrightarrow{-4} 8 \xrightarrow{-4} y = 4 20 − 4 ​ 16 − 4 ​ 12 − 4 ​ 8 − 4 ​ y = 4

The missing pair is ( 17 , 4 ) (17, 4) ( 17 , 4 ) .

4. Power, Prime, Factorial & Recursive Fibonacci-Type Series

Some sequences depend on canonical number-theoretic sets or multi-term recurrences rather than single-step arithmetic:

Shifted Squares and Cubes: Memorize squares up to 20 2 = 400 20^2 = 400 2 0 2 = 400 and cubes up to 10 3 = 1000 10^3 = 1000 1 0 3 = 1000 . A sequence like 0 , 7 , 26 , 63 , 124 , ? 0, 7, 26, 63, 124, ? 0 , 7 , 26 , 63 , 124 , ? is immediately recognizable as n 3 − 1 n^3 - 1 n 3 − 1 for n = 1 , 2 , 3 , 4 , 5 , 6 n = 1, 2, 3, 4, 5, 6 n = 1 , 2 , 3 , 4 , 5 , 6 , yielding 6 3 − 1 = 215 6^3 - 1 = 215 6 3 − 1 = 215 . Similarly, 2 , 5 , 10 , 17 , 26 , 37 2, 5, 10, 17, 26, 37 2 , 5 , 10 , 17 , 26 , 37 represents n 2 + 1 n^2 + 1 n 2 + 1 .

Prime-Indexed Shifts: The prime numbers ( 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , … 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, \dots 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , … ) often appear either as terms ( p n ± 1 p_n \pm 1 p n ​ ± 1 ) or as first differences ( Δ 1 = + 2 , + 3 , + 5 , + 7 , + 11 , … \Delta_1 = +2, +3, +5, +7, +11, \dots Δ 1 ​ = + 2 , + 3 , + 5 , + 7 , + 11 , … ). Be careful not to confuse + 3 , + 5 , + 7 +3, +5, +7 + 3 , + 5 , + 7 (odd numbers, next + 9 +9 + 9 ) with + 2 , + 3 , + 5 , + 7 +2, +3, +5, +7 + 2 , + 3 , + 5 , + 7 (primes, next + 11 +11 + 11 ).

Factorials: 1 ! = 1 , 2 ! = 2 , 3 ! = 6 , 4 ! = 24 , 5 ! = 120 , 6 ! = 720 1! = 1, 2! = 2, 3! = 6, 4! = 24, 5! = 120, 6! = 720 1 ! = 1 , 2 ! = 2 , 3 ! = 6 , 4 ! = 24 , 5 ! = 120 , 6 ! = 720 , where the step multipliers increase consecutively ( × 2 , × 3 , × 4 , × 5 , × 6 \times 2, \times 3, \times 4, \times 5, \times 6 × 2 , × 3 , × 4 , × 5 , × 6 ).

Fibonacci & Lucas Recursions: Each term is the sum (or product) of the two preceding terms: a n = a n − 1 + a n − 2 a_n = a_{n-1} + a_{n-2} a n ​ = a n − 1 ​ + a n − 2 ​

For instance, in 3 , 4 , 7 , 11 , 18 , 29 , ? 3, 4, 7, 11, 18, 29, ? 3 , 4 , 7 , 11 , 18 , 29 , ? , each term equals the sum of the two terms before it ( 18 + 29 = 47 18 + 29 = 47 18 + 29 = 47 ).

5. Digit-Sum and Positional Number Series ( Rakamları Toplamı Dizileri )

When first differences look erratic (for example, + 8 , + 7 , + 5 , + 10 , + 11 +8, +7, +5, +10, +11 + 8 , + 7 , + 5 , + 10 , + 11 ) and no polynomial or geometric rule fits, inspect the base-10 digits of each term. In a digit-sum recurrence, the step added to a n a_n a n ​ is the sum (or product) of the digits of a n a_n a n ​ itself: a n + 1 = a n + S ( a n ) a_{n+1} = a_n + S(a_n) a n + 1 ​ = a n ​ + S ( a n ​ )

Worked Example 3: Self-Referential Digit-Sum Progression

Find the next term in: 17 , 25 , 32 , 37 , 47 , 58 , ? 17, 25, 32, 37, 47, 58, ? 17 , 25 , 32 , 37 , 47 , 58 , ?

Check first differences: + 8 , + 7 , + 5 , + 10 , + 11 +8, +7, +5, +10, +11 + 8 , + 7 , + 5 , + 10 , + 11 . These are neither monotonic nor periodic.

Compare each difference to the digits of the preceding term:

  • 17 → 1 + 7 = 8 ⟹ 17 + 8 = 25 17 \to 1 + 7 = 8 \implies 17 + 8 = 25 17 → 1 + 7 = 8 ⟹ 17 + 8 = 25
  • 25 → 2 + 5 = 7 ⟹ 25 + 7 = 32 25 \to 2 + 5 = 7 \implies 25 + 7 = 32 25 → 2 + 5 = 7 ⟹ 25 + 7 = 32
  • 32 → 3 + 2 = 5 ⟹ 32 + 5 = 37 32 \to 3 + 2 = 5 \implies 32 + 5 = 37 32 → 3 + 2 = 5 ⟹ 32 + 5 = 37
  • 37 → 3 + 7 = 10 ⟹ 37 + 10 = 47 37 \to 3 + 7 = 10 \implies 37 + 10 = 47 37 → 3 + 7 = 10 ⟹ 37 + 10 = 47
  • 47 → 4 + 7 = 11 ⟹ 47 + 11 = 58 47 \to 4 + 7 = 11 \implies 47 + 11 = 58 47 → 4 + 7 = 11 ⟹ 47 + 11 = 58

Apply to 58 58 58 : The digit sum is 5 + 8 = 13 5 + 8 = 13 5 + 8 = 13 , so ? = 58 + 13 = 71 ? = 58 + 13 = 71 ? = 58 + 13 = 71 .

Master Reference Table: TR-YÖS Number Series Archetypes

Series Family Diagnostic Signature Algebraic Form Classic Example Next Term

1st-Order Arithmetic Constant Δ 1 = d \Delta_1 = d Δ 1 ​ = d a n = a 1 + ( n − 1 ) d a_n = a_1 + (n-1)d a n ​ = a 1 ​ + ( n − 1 ) d 7 , 13 , 19 , 25 , 31 , ? 7, 13, 19, 25, 31, ? 7 , 13 , 19 , 25 , 31 , ? 37 37 37 ( + 6 +6 + 6 )

2nd-Order Quadratic Constant Δ 2 = c \Delta_2 = c Δ 2 ​ = c a n = A n 2 + B n + C a_n = An^2 + Bn + C a n ​ = A n 2 + B n + C 3 , 5 , 9 , 15 , 23 , 33 , ? 3, 5, 9, 15, 23, 33, ? 3 , 5 , 9 , 15 , 23 , 33 , ? 45 45 45 ( Δ 1 : + 2 , + 4 , + 6 , + 8 , + 10 , + 12 \Delta_1: +2, +4, +6, +8, +10, +12 Δ 1 ​ : + 2 , + 4 , + 6 , + 8 , + 10 , + 12 )

Multiplicative-Additive Δ 1 \Delta_1 Δ 1 ​ grows by factor r r r a n + 1 = r ⋅ a n ± k a_{n+1} = r \cdot a_n \pm k a n + 1 ​ = r ⋅ a n ​ ± k 5 , 11 , 23 , 47 , 95 , ? 5, 11, 23, 47, 95, ? 5 , 11 , 23 , 47 , 95 , ? 191 191 191 ( × 2 + 1 \times 2 + 1 × 2 + 1 )

Alternating Operator Step ratio/diff alternates × r \times r × r then ± k \pm k ± k 3 , 6 , 10 , 20 , 24 , 48 , ? 3, 6, 10, 20, 24, 48, ? 3 , 6 , 10 , 20 , 24 , 48 , ? 52 52 52 ( × 2 , + 4 \times 2, +4 × 2 , + 4 cycle)

Interleaved Dual 7+ terms or up-down oscillation Odd a 2 k − 1 a_{2k-1} a 2 k − 1 ​ vs. Even a 2 k a_{2k} a 2 k ​ 2 , 15 , 6 , 13 , 10 , 11 , 14 , ? 2, 15, 6, 13, 10, 11, 14, ? 2 , 15 , 6 , 13 , 10 , 11 , 14 , ? 9 9 9 (Even terms − 2 -2 − 2 )

Shifted Powers Near n 2 n^2 n 2 or n 3 n^3 n 3 milestones a n = n k ± c a_n = n^k \pm c a n ​ = n k ± c 2 , 9 , 28 , 65 , 126 , ? 2, 9, 28, 65, 126, ? 2 , 9 , 28 , 65 , 126 , ? 217 217 217 ( n 3 + 1 n^3 + 1 n 3 + 1 for n = 6 n=6 n = 6 )

Two-Term Recursive a n − a n − 1 = a n − 2 a_n - a_{n-1} = a_{n-2} a n ​ − a n − 1 ​ = a n − 2 ​ a n = a n − 1 + a n − 2 a_n = a_{n-1} + a_{n-2} a n ​ = a n − 1 ​ + a n − 2 ​ 2 , 5 , 7 , 12 , 19 , 31 , ? 2, 5, 7, 12, 19, 31, ? 2 , 5 , 7 , 12 , 19 , 31 , ? 50 50 50 ( 19 + 31 19 + 31 19 + 31 )

Digit-Sum Driven Irregular Δ 1 = S ( a n ) \Delta_1 = S(a_n) Δ 1 ​ = S ( a n ​ ) a n + 1 = a n + ∑ digits ( a n ) a_{n+1} = a_n + \sum \text{digits}(a_n) a n + 1 ​ = a n ​ + ∑ digits ( a n ​ ) 23 , 28 , 38 , 49 , 62 , ? 23, 28, 38, 49, 62, ? 23 , 28 , 38 , 49 , 62 , ? 70 70 70 ( 62 + 6 + 2 62 + 6 + 2 62 + 6 + 2 )

Checking What the Evidence Actually Determines

A short finite list does not determine a unique mathematical sequence unless the question restricts the rule. For the three terms 2, 4, 8, doubling gives a next term of 16, but the expression a n = n 2 − n + 2 a_n=n^2-n+2 a n ​ = n 2 − n + 2 gives the same first three terms and then 14. Both fit the available observations. A fourth supplied term can reject one candidate: if it is 16, the quadratic rule fails. This explains why checking every supplied transition matters more than finding one attractive coincidence.

In an original multiple-choice pattern exercise, prefer a simple rule that consistently accounts for the whole display and the stated constraints. Record the operation and its scope: doubling every term is different from doubling only the odd-position subsequence. If two equally plausible rules lead to different offered answers, recheck the diagram, alternating positions and any explicit restrictions. Do not describe a pattern guess as a proof of uniqueness. This distinction also helps during review: a wrong answer can result from overlooking a second track rather than from performing the arithmetic incorrectly.

Review the Method

Non-standard sequences include shifted powers (n² ± 1, n³ ± 1), consecutive primes, factorials, Fibonacci-type recursions, and self-referential digit-sum progressions

Loading diagram... 30-Second Diagnostic Decision Tree for TR-YÖS Number Series