Exact Linear Recurrence Workbench

How to use Exact Linear Recurrence Workbench

The coefficients are ordered from the immediately preceding term to the oldest dependency: a[n] = c[0]a[n−1] + c[1]a[n−2] + …. Supplied initial terms start at index zero. BigInt arithmetic preserves each supported integer exactly.

1. Enter coefficient json (newest dependency first), initial term json (index zero first), output term count.
2. Choose the stated convention and check the units and supported model.
3. Calculate, inspect the result, then copy or download it.

Good to know

• Order 1–10, exactly one initial term per coefficient, and 1–500 output terms. Inputs are integers of magnitude at most 1000000; intermediate values are limited to 8192 bits. No symbolic expressions, variable coefficients, arbitrary code, closed-form solving or automatic sequence discovery. Requesting fewer terms than the order returns the corresponding initial prefix.
• Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.