|
%I #6 Dec 05 2013 19:56:32
%S 5,5,7,17,23,29,37,41,53,59,67,79,83,89,97,109,131,127,137,149,151,
%T 163,173,181,197,211,211,223,233,233,271,269,277,281,311,311,317,353,
%U 337,349,359,367,389,389,397,401,433,449,457,461,479,479,487,509,521,557
%N Let S(k) be the set of absolute differences of pairs of primes <= k. a(n) is the least k such that S(k) contains all residues mod prime(n).
%C Needs better description.
%e a(3) = 7, 7-2==0 (mod 5), 3-2 ==1 (mod 5), 5-3 ==2 (mod 5), 5-2 ==3 (mod 5),
%e 7-3 == 4 (mod 5).
%e a(5) = 23 and we have 13-2 == 0 (mod 11), 3-2=1, 5-3=2, 5-2=3, 7-3=4, 7-2 =5, 11-5 = 6, 23-5 == 7 (mod 11), 13-5 = 8, 11-2 = 9, 13-3 = 10.
%Y Cf. A088046, A088047, A109257.
%K nonn
%O 1,1
%A _Amarnath Murthy_, Sep 20 2003
%E More terms from _David Wasserman_, Jun 23 2005
|
