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.
k = 1; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k - 32] && k>32, Print[n]; AppendTo[a, n]], {n, 2, 325}]; a
k = 1/2; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k + 64], Print[n]; AppendTo[a, n]], {n, 325}]; a
k = 1; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k - 64]&&k>64, Print[n]; AppendTo[a, n]], {n, 2, 325}]; a
Flatten[Position[Rest[FoldList[Times,1,Prime[Range[600]]]],?(PrimeQ[ #/2-64]&&#/2>64&)]] (* _Harvey P. Dale, Mar 05 2013 *)
Select[Range[4, 100], PrimeQ[Product[Prime[k], {k, 1, #}]/2 - 64] &] (* Robert Price, Apr 10 2017 *)
k = 1/2; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k + 128], Print[n]; AppendTo[a, n]], {n, 325}]; a
Select[Range[0, 25000], PrimeQ[Product[Prime[k], {k, 1, #}]/2 + 128] &] (* Robert Price, Apr 10 2017 *)
k = 1; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k - 128]&&k>128, Print[n]; AppendTo[a, n]], {n, 2, 325}]; a
k = 1/2; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k + 256], Print[n]; AppendTo[a, n]], {n, 325}]; a
k = 1; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k - 256]&&k>256, Print[n]; AppendTo[a, n]], {n, 2, 325}]; a
k = 1/2; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k + 512], Print[n]; AppendTo[a, n]], {n, 325}]; a
k = 1; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k - 512]&&k>512, Print[n]; AppendTo[a, n]], {n, 2, 325}]; a (* corrected by Ray Chandler, Jun 16 2013 *)
k = 1/2; a = {}; Do[k = k*Prime[n]; If[PrimeQ[k + 1024], Print[n]; AppendTo[a, n]], {n, 325}]; a
isok(n) = isprime(1024+prod(k=2, n, prime(k))); \\ Michel Marcus, Jul 02 2017
Comments