RecurrenceTable[eqns, expr, {n, n_max}] generates a list of values of expr for successive n based on solving the recurrence equations eqns.RecurrenceTable[eqns, expr, nspec] ...
The symbolic character of Mathematica makes possible a uniquely coherent approach to integer sequences, integrating functional forms, equations, generating functions, and ...
DependentVariables is an option which specifies the list of all objects that should be considered as dependent variables in equations that have been supplied.
Mathematica has a wide coverage of named functions defined by sums and recurrence relations. Often using original algorithms developed at Wolfram Research, Mathematica ...
In calculus even more than other areas, Mathematica packs centuries of mathematical development into a small number of exceptionally powerful functions. Continually enhanced ...
With origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. ...
Built into Mathematica is the world's largest collection of both numerical and symbolic equation solving capabilities—with many original algorithms, all automatically ...
Mathematica has been used to make many important discoveries in discrete mathematics over the past two decades. Its integration of highly efficient and often original ...
Mathematica 7 represents another major achievement in Mathematica's long history of innovation in mathematics and algorithms. Building on the broad capabilities of ...
LinearRecurrence[ker, init, n] gives the sequence of length n obtained by iterating the linear recurrence with kernel ker starting with initial values ...