|
%I #22 Apr 03 2022 11:42:23
%S 0,1,1,13,1,17,59,23,79,101,83,239,71,149,367,73,911,313,373,523,313,
%T 331,197,101,1493,523,293,577,2699,1481,1453,5647,647,419,757,4253,
%U 509,239,10499,191,4013,2659,617,6733,1297,971
%N Smallest k such that prime(n)# - k and prime(n)# + k are primes, where prime(n)# = A002110(n).
%C a(n) = A002110(n) - A094710(n) = A094711(n) - A002110(n),
%C Goldbach's conjecture implies that a(n) is defined for all n. - _David Wasserman_, May 31 2007
%H David Wasserman, <a href="/A094709/b094709.txt">Table of n, a(n) for n = 1..250</a>
%e a(4)=13 because prime(4)=7, 7# = 2*3*5*7 = 210, and 210 - 13 and 210 + 13 are primes.
%t pc[n_]:=Module[{x=0,i=0},Do[If[PrimeQ[n-i]&&PrimeQ[n+i],x=i;Break[]],{i,9!}];x]; r=2;lst={};Do[p=Prime[n];r*=p;AppendTo[lst,pc[r]],{n,2,2*4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jun 14 2009 *)
%t sk[n_]:=Module[{k=0},While[!PrimeQ[n+k]||!PrimeQ[n-k],k++];k]; sk/@ FoldList[ Times,Prime[Range[50]]] (* _Harvey P. Dale_, Apr 03 2022 *)
%o (Python)
%o from sympy import isprime, prime, primerange
%o def aupton(terms):
%o phash, alst = 2, [0]
%o for p in primerange(3, prime(terms)+1):
%o phash *= p
%o for k in range(1, phash//2):
%o if isprime(phash-k) and isprime(phash+k): alst.append(k); break
%o return alst
%o print(aupton(46)) # _Michael S. Branicky_, May 29 2021
%Y Cf. A078611, A002110, A094710, A094711.
%K nonn
%O 1,4
%A _Reinhard Zumkeller_, May 21 2004
%E More terms from _Don Reble_, May 27 2004
|
