Number Sequence Calculator

Calculate terms and sums for arithmetic, geometric and Fibonacci sequences.

Arithmetic Sequence Calculator

definition: an = a1 + f × (n−1)

example: 1, 3, 5, 7, 9, 11, 13, ...

Result

Sequence: 2, 7, 12, 17, 22, 27, 32, 37, 42 ...

20th value: 97

The sum of all numbers up through the 20th: 990

Sequence Growth Chart

Geometric Sequence Calculator

definition: an = a × rn−1

example: 1, 2, 4, 8, 16, 32, 64, 128, ...

Result

Sequence: 2, 10, 50, 250, 1250, 6250, 31250, 156250, 781250 ...

12th value: 97656250

The sum of all numbers up through the 12th: 122070312

Sequence Growth Chart

Fibonacci Sequence Calculator

definition: an = an−1 + an−2, where a1 = 1, a2 = 1

example: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

Result

Sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

10th value: 55

The sum of all numbers up through the 10th: 143

Sequence Growth Chart

Complete Number Sequence Guide & Information

1. What is a Number Sequence?

A number sequence is an ordered list of numbers that follow a specific pattern or rule. Each number in the sequence is called a term. Sequences can be finite or infinite. This calculator handles three of the most important types: arithmetic, geometric, and Fibonacci.

2. Arithmetic Sequence

An arithmetic sequence is a sequence where each term after the first is obtained by adding a constant difference. The difference between consecutive terms is always the same.

Nth term formula

an = a1 + (n − 1) × d

where a1 is the first term, d is the common difference, and n is the term number.

Sum of first n terms

Sn = n × (a1 + an) / 2

or equivalently:

Sn = n × [2a1 + (n − 1) × d] / 2

Properties

3. Geometric Sequence

A geometric sequence is a sequence where each term after the first is found by multiplying the previous term by a constant called the common ratio.

Nth term formula

an = a1 × rn−1

where a1 is the first term, r is the common ratio, and n is the term number.

Sum of first n terms

Sn = a1 × (1 − rn) / (1 − r)    (r ≠ 1)

Properties

4. Fibonacci Sequence

The Fibonacci sequence starts with 1, 1 (or sometimes 0, 1), and each subsequent term is the sum of the two preceding terms. It appears throughout nature, art, and mathematics.

Recurrence relation

F1 = 1,   F2 = 1
Fn = Fn−1 + Fn−2   for n > 2

Closed-form (Binet's formula)

Fn = (φn − ψn) / √5
where φ = (1+√5)/2 ≈ 1.618 (golden ratio), ψ = (1−√5)/2 ≈ −0.618

Sum of first n terms

Σk=1n Fk = Fn+2 − 1

Properties

5. Input & Control Definitions

6. Worked Examples

Example 1 — Arithmetic (default): a₁ = 2, d = 5, n = 20

Example 2 — Geometric (default): a₁ = 2, r = 5, n = 12

Example 3 — Fibonacci (default): n = 10

7. Real-World Applications

8. Comparison Reference Table

Property Arithmetic Geometric Fibonacci
Growth typeLinearExponentialExponential (slower)
ConstantDifference dRatio rSum of previous two
Nth term formulaa₁ + (n−1)da₁ × rn−1Recursive / Binet's
Sum formulan(a₁+aₙ)/2a₁(1−rⁿ)/(1−r)Fn+2 − 1
Example n=102,7,12,...,472,10,50,...,3,906,2501,1,2,...,55

9. Important Notes

10. Related Mathematical Concepts

11. References

1. Fibonacci, Leonardo. "Liber Abaci." 1202.
2. Euclid. "Elements." Book VI, Proposition 30 (golden ratio). ~300 BCE.
3. Knuth, Donald E. "Concrete Mathematics." Addison-Wesley. 1994.
4. Koshy, Thomas. "Fibonacci and Lucas Numbers with Applications." Wiley. 2001.
5. Stewart, Ian. "Mathematical Recreations: The Tales of a Not-So-Famous Number." Scientific American. 1995.
6. Dunlap, Richard A. "The Golden Ratio and Fibonacci Numbers." World Scientific. 1997.