Constant-recursive sequence
id:
constant-recursive-sequence-224-4216123
title:
Constant-recursive sequence
text:
In mathematics, an infinite sequence of numbers s 0, s 1, s 2, s 3, … is called constant-recursive if it satisfies an equation of the form
- s n = c 1 s n − 1 + c 2 s n − 2 + ⋯ + c d s n − d, for all n ≥ d, where c i are constants. The equation is called a linear recurrence relation.
The concept is also known as a linear recurrence sequence, linear-recursive sequence, linear-recurrent sequence, or a C-finite sequence. For example, the Fibonacci sequence
- 0, 1, 1, 2, 3, 5, 8, 13, …, is const
brand slug:
wiki
category slug:
encyclopedia
description:
Infinite sequence of numbers satisfying a linear equation
original url:
https://en.wikipedia.org/wiki/Constant-recursive_sequence
date created:
2016-03-09T18:04:24Z
date modified:
2024-09-14T13:05:58Z
main entity:
{"identifier":"Q23835453","url":"https://www.wikidata.org/entity/Q23835453"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/99/Constant-recursive-sequences.svg","width":512,"height":416}
fields total:
13
integrity:
16