cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Jason Earls, Sep 04 2005

Keywords

Crossrefs

Cf. A109611.

Programs

  • 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 *)

Extensions

More terms from Ryan Propper, Sep 27 2006