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!)
A075410 a(n) is the smallest m such that n!!-m and n!!+m are both primes. 2

%I #7 Sep 02 2017 11:01:19

%S 0,0,3,2,5,2,5,8,7,4,19,16,29,68,97,16,109,86,19,158,17,172,41,16,529,

%T 106,263,212,163,302,593,302,607,262,311,428,227,106,1271,8,229,386,

%U 1489,32,47,1996,1097,2566,41,632,1913,458,149,1244,2837,362,3317,908

%N a(n) is the smallest m such that n!!-m and n!!+m are both primes.

%C For n = 5,7,10,11,22,41,67,76,91,96,163,245,299,341, n!! is an interprime, the average of two consecutive primes, see A075275. See also n^n and n! as average of two primes in A075468 and A075409.

%e a(4) = 3 because 4!! = 8 and 8 -/+ 3 = 5 and 11 are primes with smallest equal distances from 4!!

%t smbp[n_]:=Module[{m=0,n2=n!!},While[Total[Boole[PrimeQ[n2+{m,-m}]]] != 2,m++];m]; Array[smbp,60,2] (* _Harvey P. Dale_, Sep 02 2017 *)

%Y Cf. A075275, A075468 and A075409.

%K nonn

%O 2,3

%A _Zak Seidov_, Sep 18 2002

%E More terms from _David Wasserman_, Jan 17 2005

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 April 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)