learn.howToCalculate
learn.whatIsHeading
A recursive sequence defines each term using previous terms. The Fibonacci sequence is the most famous example (each term is the sum of the two before it). Many real-world processes follow recursive patterns.
공식
General form: aₙ = f(aₙ₋₁, aₙ₋₂, ...) with initial conditions
- aₙ
- nth term of sequence
- aₙ₋₁, aₙ₋₂,...
- previous terms
- f
- recurrence relation function
단계별 가이드
- 1Define base cases: a₀, a₁
- 2Define recurrence: aₙ = f(aₙ₋₁, aₙ₋₂)
- 3For aₙ = p×aₙ₋₁ + q×aₙ₋₂
- 4Fibonacci is p=1, q=1
풀어진 예시
입력
a₀=1, a₁=1, aₙ=aₙ₋₁+aₙ₋₂
결과
1,1,2,3,5,8,13,21 (Fibonacci)
입력
a₀=1, a₁=2, aₙ=2aₙ₋₁−aₙ₋₂
결과
1,2,3,4,5,6 (arithmetic)
자주 묻는 질문
What is the difference between a recursive and explicit formula?
Recursive: defines aₙ using prior terms. Explicit: gives aₙ directly in terms of n.
Can every recursive sequence be expressed as explicit?
Not always easily. Some recursive sequences are difficult to express in closed form.
What are initial conditions in a recursive definition?
The first few terms (e.g., a₀ or a₁, a₂) that anchor the recursion so you can compute all later terms.
계산할 준비가 되셨나요? 무료 Recursive Sequence 계산기를 사용해 보세요
직접 시도해 보세요 →