This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
if n = 2, A(n) = A(2) = 3 because A(0) = 2, A(1) = 1 * A(0) + 1 = 3, as the distances of n from closest prime are 2, 1, 0, 0, 1 ...
A[0]:=d[0]; A[1]:=d[1]*A[0]+1; B[0]:=1; B[1]:=d[1]*B[0]; for n from 2 by 1 to N do A[n]:=d[n]*A[n-1]+A[n-2]; B[n]:=d[n]*B[n-1]+B[n-2]; od;
if n = 2, B(n) = B(2) = 1 because B(0) = 1, B(1) = 1 * B(0) = 1 as the distances of n from closest prime are 2, 1, 0, 0, 1 ...
A[0]:=d[0]; A[1]:=d[1]*A[0]+1; B[0]:=1; B[1]:=d[1]*B[0]; for n from 2 by 1 to N do A[n]:=d[n]*A[n-1]+A[n-2]; B[n]:=d[n]*B[n-1]+B[n-2]; od;
Comments