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.
+------+------+-----+ | a(n) | next | gap | | | prime| | +------+------+-----+ | 1 | 2 | 1 | | 0 | 2 | 2 | | 8 | 11 | 3 | | 7 | 11 | 4 | | 24 | 29 | 5 | | 23 | 29 | 6 | | 90 | 97 | 7 | | 89 | 97 | 8 | +------+------+-----+
N:= 100: A:= Vector(N,-1): count:= 0: lastp:= 0: while count < N do p:= nextprime(lastp); newvals:= select(t -> A[t]=-1, [$1..min(p-lastp,N)]); count:= count+nops(newvals); for k in newvals do A[k]:= p-k od; lastp:= p; od: convert(A,list); # Robert Israel, Aug 23 2019
Table[SelectFirst[Range[0, 20000], NextPrime[#] - # == n &], {n, 1, 50}]
Module[{nn=20000,d},d=Table[{n,NextPrime[n]-n},{n,0,nn}];Table[SelectFirst[d,#[[2]]==k&],{k,50}]][[;;,1]] (* Harvey P. Dale, Mar 23 2025 *)
a(n) = my(k=0); while(nextprime(k+1) - k != n, k++); k; \\ Michel Marcus, Aug 21 2019
Comments