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!)
A151893 a(n) = smallest number k such that n! + k-th prime after n! is prime. 4

%I #7 Mar 14 2020 05:02:57

%S 1,1,1,1,2,1,1,2,4,10,2,4,3,1,1,4,2,9,14,1,6,14,6,5,1,11,3,35,14,20,4,

%T 1,10,1,1,6,37,33,25,17,62,2,5,26,12,10,11,37,9,9,4,50,32,9,9,7,9,47,

%U 10,40,80,60,3,18,6,2,1

%N a(n) = smallest number k such that n! + k-th prime after n! is prime.

%H Amiram Eldar, <a href="/A151893/b151893.txt">Table of n, a(n) for n = 1..300</a>

%t a = {}; Do[k = 1; While[ ! PrimeQ[n! + NextPrime[n!, k]], k++ ]; Print[k]; AppendTo[a, k], {n, 1, 200}]; a

%Y Cf. A002981, A151892, A151894, A151903, A139213, A139214.

%K nonn

%O 1,5

%A _Artur Jasinski_, Apr 12 2008

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 August 27 21:11 EDT 2024. Contains 375471 sequences. (Running on oeis4.)