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.

A109994 Chen primes p such that their p + 2 counterpart is a Sarrus number (pseudoprime to base 2).

This page as a plain text file.
%I A109994 #8 Jun 28 2019 10:52:10
%S A109994 2699,4679,10259,14489,18719,19949,31607,42797,49139,85487,90749,
%T A109994 104651,129887,226799,294269,396269,422657,458987,481571,665279,
%U A109994 710531,729059,1082399,1251947,1302449,1994687,2035151,2510567,2811269,3090089
%N A109994 Chen primes p such that their p + 2 counterpart is a Sarrus number (pseudoprime to base 2).
%C A109994 Conjecture: sequence is infinite.
%H A109994 Amiram Eldar, <a href="/A109994/b109994.txt">Table of n, a(n) for n = 1..10000</a>
%t A109994 Select[Range[10^5], PrimeQ[#] && PowerMod[2, (# + 1), # + 2] == 1 && PrimeNu[# + 2] == 2 &] (* _Amiram Eldar_, Jun 28 2019 *)
%Y A109994 Cf. A109611, A001567.
%K A109994 nonn
%O A109994 1,1
%A A109994 _Jason Earls_, Sep 01 2005