ckrause
ckrause
**Describe the problem** The wrapper app is not support on ARM 64-bit GNU/Linux. We have user requests to support ARM64 for our Boinc project (LODA). **Describe the solution you'd like**...
It would be nice to publish a (ranked) list of program submitters. Ideally integrated in BOINC.
For faster computation using PARI, use vectors to cache previously computed terms, e.g. for `a(n)=if(n
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)...
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) =...
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)...