loda-cpp

loda-cpp copied to clipboard

Vector-based PARI output

2

For faster computation using PARI, use vectors to cache previously computed terms, e.g. for `a(n)=if(n

ckrause

replace simple recursions

1

ckrause

remove PARI limitation for binomial with negative args

2

ckrause

ckrause

ckrause

The currently generated formula for [A001042](https://oeis.org/A001042) is: ``` a(n) = a(n-1)^2-a(n-1)+b(n-1), b(n) = -a(n-1)+b(n-1) ``` Note that by Gaussian elimination we should find a simpler formula for b(n): ``` a(n)-b(n)...

ckrause

Example: ```asm ; A266709: Coefficient of x in minimal polynomial of the continued fraction [2,1^n,2,1,1,...], where 1^n means n ones. ; Formula: a(n) = b(n+2), b(n) = 2*b(n-1)+2*b(n-2)-b(n-3), b(3) =...

ckrause

Simplify exponential functions

1

Check this formula: ``` ; A139486: a(n) = Product_{j=0..n-1} (2^j + 2). ; Formula: a(n) = a(n-1)*(2*b(n-2)+2), a(1) = 3, a(0) = 1, b(n) = 2*b(n-1), b(1) = 2, b(0)...

ckrause

Needed for formula generation of decimal expansions of irational constants.

ckrause

We currently use the same number of terms as min number and number of minimization terms. Is it possible to introduce a new constant for the number of minimization terms...

ckrause