%I #4 Mar 31 2012 13:20:57
%S 3,5,5,7,7,11,17,11,11,13,13,17,29,23,17,19,19,23,41,29,23,29,53,29,
%T 53,47,29,31,31,0,67,47,71,37,37,61,79,59,41,89,43,67,89,71,47,71,97,
%U 73,101,127,53,73,109,103,113,151,59,151,61,0,127,157,131,97,67,0,137,131
%N Let S(k) be the set of signed differences of pairs of primes <= k. a(n) is the least k such that S(k) contains all residues mod n, or 0 if no such k exists.
%Y Cf. A109257.
%K easy,nonn,less
%O 1,1
%A _David Wasserman_, Jun 23 2005