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!)
A121837 Least positive j such that Product_{k=1..n} D(k) + j is prime, where D() are the doublets, A020338. 1

%I #25 Jun 25 2021 23:13:48

%S 2,9,7,7,17,7,29,17,19,23,23,13,29,79,19,89,97,53,43,347,127,127,149,

%T 29,167,331,379,61,59,167,199,557,107,113,43,191,439,41,263,227,109,

%U 71,227,137,149,409,271,53,157,79,503,103,461,137,587,233,491,73,367,233,449

%N Least positive j such that Product_{k=1..n} D(k) + j is prime, where D() are the doublets, A020338.

%C Is every term for n > 2 always prime?

%C a(159) = 1. - _Michel Marcus_, Jan 07 2021

%C a(n) = 1 for n = 245 and 702 (using ispseudoprime() in PARI). - _Michel Marcus_, Jan 08 2021

%H Michel Marcus, <a href="/A121837/b121837.txt">Table of n, a(n) for n = 1..200</a>

%F a(n) = A013632(A121826(n)). - _Michel Marcus_, Jan 07 2021

%o (PARI) D(n) = eval(Str(n, n)); \\ A020338

%o f(n) = prod(k=1, n, D(k)); \\ A121826

%o a(n) = my(q=f(n)); nextprime(q+1) - q; \\ _Michel Marcus_, Jan 07 2021

%Y Cf. A013632, A020338, A121826, A151800.

%K nonn,base

%O 1,1

%A _Jason Earls_, Aug 28 2006

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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)