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.
Block[{s = Select[Partition[Prime@ Range[10^7], 2, 1], Subtract @@ # == -2 &][[All, -1]], t}, t = Differences@ s; Map[s[[FirstPosition[t, #]]] &, Union@ FoldList[Max, t]][[All, 1]]] (* Michael De Vlieger, Jan 18 2019 *)
P:= select(isprime, [seq(i,i=3..10^7,2)]):
A:= 'A':
state:= 0: smax := 0:
for i from 2 to nops(P) do
if P[i] - P[i-1] >= 4 then
state:= state + 1;
if state > smax then smax:= state; A[state+1]:= P[i-state] fi
else
state:= 0;
fi
od:
seq(A[i],i=2..smax+1); # Robert Israel, Jun 27 2017
Prime[#]&/@With[{pd=If[#>2,1,0]&/@Differences[Prime[Range[3000]]]}, Flatten[ Table[ SequencePosition[pd,PadRight[{},n,1],1][[All,1]],{n,45}]]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 29 2018 *)
nextLesserTwinPrime[p_Integer] := Block[{q = p + 2}, While[ NextPrime@ q - q > 2, q = NextPrime@ q]; q]; p = 2; q = 3; px = 1; qx = 2; mxd = 0; tpx = 0; lst = {}; While[p <
5090000001, d = qx - px; If[ d > mxd, mxd = d; AppendTo[ lst, d]; Print@ d]; p = q; px = qx; q = nextLesserTwinPrime@ q; qx = PrimePi@ q; tpx++]; lst (* Robert G. Wilson v, May 21 2014 *)
def A242459_list(n) : a = [ 1 ] st = 3 for i in (4..n) : if (nth_prime(i+1)-nth_prime(i) == 2) : if i-st > a[len(a)-1] : a.append(i-st) st = i return(a) A242459_list(10^(5))
Comments