Clark, David A. and Jarvis, Norman C., Dense admissible sequences. Math. Comp. (2001), 1713-1718.

Erdős, Paul, A survey of problems in combinatorial number theory. Ann. Discrete Math. (1980), 89-115.

Erdős, P., On some of my problems in number theory I would most like to see solved. Number theory (Ootacamund, 1984) (1985), 74-84.

Guy, Richard K., Unsolved problems in number theory. Third edition, Problem Books in Mathematics, Springer (2004), xviii+437 pp. Section A9 "Patterns of primes", printed p. 40: the prime-pattern conjecture is "incompatible with the well-known conjecture (also due to Hardy & Littlewood)" that $\pi(x+y)\le\pi(x)+\pi(y)$ for all integers $x,y\ge2$, a display Guy sets between inverted and upright question marks because it "is very likely to be false", with the Montgomery--Vaughan bound. Library home: Guy 2004.

Hensley, Douglas and Richards, Ian, On the incompatibility of two conjectures concerning primes. (1973), 123-127.

Montgomery, H. L. and Vaughan, R. C., The large sieve. Mathematika (1973), 119-134.