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).

A088048

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).

Terms

    a(0) =5a(1) =5a(2) =7a(3) =17a(4) =23a(5) =29a(6) =37a(7) =41a(8) =53a(9) =59a(10) =67a(11) =79a(12) =83a(13) =89a(14) =97a(15) =109a(16) =131a(17) =127a(18) =137a(19) =149a(20) =151a(21) =163a(22) =173a(23) =181a(24) =197a(25) =211a(26) =211a(27) =223a(28) =233a(29) =233

External references