%N a(n) is the least number > a(n-1) such that a(1) through a(n) do not contain all residues modulo any prime.
%C Conjecturally, a(n) is the smallest number such that n primes occur infinitely often among (x+a(1), ...,x+a(n)).
%D R. K. Guy's "Unsolved Problems in Number Theory" (2nd edition, Springer, 1994), Section A9.
%H David W. Wilson, <a href="/A020498/b020498.txt">Table of n, a(n) for n = 1..10000</a>
%Y Cf. A020497, A008407.
%A _Robert G. Wilson v_ and _Christopher E. Thompson_
%E More terms from _David Wasserman_, Aug 17 2005
%E Old name has been interchanged with Wasserman's comment, as old name only a conjectural definition of the sequence. Edited by _Christopher J. Smyth_, May 12 2016