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!)
A343593 a(n) is the smallest number k > 0 such that n! + n + k is prime. 0

%I #35 Apr 23 2021 06:38:46

%S 1,1,1,2,1,2,1,4,15,8,1,6,17,54,5,28,7,14,19,70,9,10,9,74,107,16,33,

%T 20,39,194,77,96,47,4,63,26,95,274,5,58,13,20,55,28,3,194,55,186,5,34,

%U 11,220,1,18,169,16,93,50,225,234,211,708,69,208,3,128,217

%N a(n) is the smallest number k > 0 such that n! + n + k is prime.

%F a(n) = A037153(n) - n for n >= 1.

%F a(n) = A090786(n) + 1.

%e For n = 2: the smallest value of k such that 2! + 2 + k = 4 + k is prime is 1.

%p a:= n-> (t-> nextprime(t)-t)(n!+n):

%p seq(a(n), n=0..80); # _Alois P. Heinz_, Apr 21 2021

%t a[n_] := NextPrime[(m = n! + n)] - m; Array[a, 100, 0] (* _Amiram Eldar_, Apr 21 2021 *)

%o (PARI) a(n) = my(s=n!+n); nextprime(s+1) - s; \\ _Michel Marcus_, Apr 21 2021

%Y Cf. A000040, A037153, A090786.

%K nonn

%O 0,4

%A _Ventsislav D. Tsenov_, Apr 21 2021

%E More terms from _Alois P. Heinz_, Apr 21 2021

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 19 06:44 EDT 2024. Contains 371782 sequences. (Running on oeis4.)