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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110060 Least positive k such that n^n + k is a Chen prime. 0

%I #7 Dec 15 2017 17:36:56

%S 1,1,2,1,12,23,4,73,100,19,450,281,114,241,56,51,582,527,412,771,230,

%T 997,440,95,1882,1117,224,1213,1968,29,168,421,104,2383,876,1085,5776,

%U 253,742,4909,402,2045,3414,403,2366,705,2124,6455,5662,2329,1568,20101

%N Least positive k such that n^n + k is a Chen prime.

%t (* After loading the NumberTheory package *) SemiPrimeQ[n_] := (f = FactorIntegerECM[n]; PrimeQ[f] && PrimeQ[n/f]); ShenPrimeQ[n_] := (PrimeQ[n] && (PrimeQ[n + 2] || SemiPrimeQ[n + 2])); Do[k = 1; While[ !ShenPrimeQ[n^n + k], k++ ]; Print[k], {n, 100}] (* _Ryan Propper_, Sep 27 2006 *)

%Y Cf. A109611.

%K nonn

%O 1,3

%A _Jason Earls_, Sep 04 2005

%E More terms from _Ryan Propper_, Sep 27 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.

Last modified February 26 02:39 EST 2024. Contains 370335 sequences. (Running on oeis4.)