Chen, Jing-run On the representation of a larger even integer as the sum of a prime and the product of at most two primes. (English) Zbl 0319.10056 Sci. Sin. 16, 157-176 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 30 ReviewsCited in 94 Documents MSC: 11N35 Sieves 11P32 Goldbach-type theorems; other additive questions involving primes PDF BibTeX XML Cite \textit{J.-r. Chen}, Sci. Sin. 16, 157--176 (1973; Zbl 0319.10056) OpenURL Online Encyclopedia of Integer Sequences: Chen primes: primes p such that p + 2 is either a prime or a semiprime. Least positive integer k such that prime(k*n)+2 = prime(i*n)*prime(j*n) for some 0 < i < j. Least positive integer k such that prime(k)*prime(k*n) = prime(p)+2 for some prime p. Primes p such that prime(p)+2 = prime(q)*prime(r) for distinct primes q and r. Least positive integer k such that prime(prime(k))*prime(prime(k*n)) = prime(p)+2 for some prime p. Number of Chen primes up to 10^n. Number of permutations f of {1,...,n} such that prime(k)*prime(f(k)) - 2 is prime for every k = 1,...,n.