• ← HarmonicNumber
• → StirlingS1

LinearRecurrence

Linear recurrence with constant coefficients, WMA link

LinearRecurrence[ker, init, n]

computes n terms of the linear recurrence with kernel ker and initial values init.

LinearRecurrence[ker, init, {n}]

computes the n-th term.

LinearRecurrence[ker, init, {$n_{min}$, $n_{max}$}]

computes n terms of the linear recurrence with kernel ker and initial values init.

Generate first 10 items of the Fibonacci Sequence, F[0]=1, F[1]=1:

• • LinearRecurrence[{1, 1}, {1, 1}, 10]

Extract the 3rd to 5th elements:

• • LinearRecurrence[{1, 1}, {1, 1}, {3, 5}]

Now just the 6th element:

• • LinearRecurrence[{1, 1}, {1, 1}, {6}]

See also Fibonacci.