login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097529 Least k such that k*P(n)#-P(n+5) and k*P(n)#+P(n+5) are both primes with P(i)=i-th prime and P(i)#=i-th primorial. 0

%I #7 Mar 28 2015 22:35:36

%S 8,4,2,2,1,2,5,1,34,13,60,9,38,43,2,1,23,96,33,2,151,59,22,31,327,84,

%T 45,47,47,36,34,62,589,648,193,150,1181,359,616,22,132,129,402,135,

%U 154,933,111,46,196,285,520,220,387,35,102,323,1109,833,25,292,300,1326,1093

%N Least k such that k*P(n)#-P(n+5) and k*P(n)#+P(n+5) are both primes with P(i)=i-th prime and P(i)#=i-th primorial.

%t Primorial[n_] := Product[ Prime[i], {i, n}]; f[n_] := Block[{k = 1, p = Primorial[n], q = Prime[n + 5]}, While[k*p - q < 2 || !PrimeQ[k*p - q] || !PrimeQ[k*p + q], k++ ]; k]; Table[ f[n], {n, 63}] (* _Robert G. Wilson v_, Aug 31 2004 *)

%K easy,nonn

%O 1,1

%A _Pierre CAMI_, Aug 27 2004

%E More terms from _Robert G. Wilson v_, Aug 31 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 11 13:40 EDT 2024. Contains 375836 sequences. (Running on oeis4.)