RSolve[eqn, a[n], n] solves a recurrence equation for a[n]. RSolve[{eqn_1, eqn_2, ...}, {a_1[n], a_2[n], ...}, n] solves a system of recurrence equations. RSolve[eqn, a[n_1, ...

The functionality is now available in built-in Mathematica kernel functions RSolve, ZTransform, and Sum. The built-in kernel function SeriesCoefficient now contains the ...

If you represent the n^th term in a sequence as a[n], you can use a recurrence equation to specify how it is related to other terms in the sequence. RSolve takes recurrence ...

C[i] is the default form for the i\[Null]\[Null]^th parameter or constant generated in representing the results of various symbolic computations.

Introduced soon after ordinary hypergeometric functions, the q functions have long been studied as theoretical generalizations of hypergeometric and other functions. ...

Mathematica applies its strengths in calculus to the intricacies of integral transforms, with a host of original algorithms that probably now reach almost any closed form ...

DiscreteMath`CombinatorialFunctions`, DiscreteMath`Combinatorica`, DiscreteMath`ComputationalGeometry`, DiscreteMath`GraphPlot`, DiscreteMath`IntegerPartitions`, ...

Mathematica has a wide coverage of named functions defined by sums and recurrence relations. Often using original algorithms developed at Wolfram Research, Mathematica ...

GeneratedParameters is an option that specifies how parameters generated to represent the results of various symbolic operations should be named.

ContinuedFractionK[f, g, {i, i_min, i_max}] represents the continued fraction \[CapitalKappa]_i = i_min^i_max f/g. ContinuedFractionK[g, {i, i_min, i_max}] represents the ...