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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110060 Least positive k such that n^n + k is a Chen prime. 0
 1, 1, 2, 1, 12, 23, 4, 73, 100, 19, 450, 281, 114, 241, 56, 51, 582, 527, 412, 771, 230, 997, 440, 95, 1882, 1117, 224, 1213, 1968, 29, 168, 421, 104, 2383, 876, 1085, 5776, 253, 742, 4909, 402, 2045, 3414, 403, 2366, 705, 2124, 6455, 5662, 2329, 1568, 20101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS MATHEMATICA (* 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 *) CROSSREFS Cf. A109611. Sequence in context: A055392 A045873 A265022 * A061081 A007368 A054677 Adjacent sequences: A110057 A110058 A110059 * A110061 A110062 A110063 KEYWORD nonn AUTHOR Jason Earls, Sep 04 2005 EXTENSIONS More terms from Ryan Propper, Sep 27 2006 STATUS approved

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 December 1 18:55 EST 2022. Contains 358475 sequences. (Running on oeis4.)