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

3, 5, 5, 7, 7, 11, 17, 11, 11, 13, 13, 17, 29, 23, 17, 19, 19, 23, 41, 29, 23, 29, 53, 29, 53, 47, 29, 31, 31, 0, 67, 47, 71, 37, 37, 61, 79, 59, 41, 89, 43, 67, 89, 71, 47, 71, 97, 73, 101, 127, 53, 73, 109, 103, 113, 151, 59, 151, 61, 0, 127, 157, 131, 97, 67, 0, 137, 131

Offset

1,1

Links

Table of n, a(n) for n=1..68.

Crossrefs

Cf. A109257.

Sequence in context: A305216 A087821 A204894 * A088081 A206768 A168322

Adjacent sequences: A109255 A109256 A109257 * A109259 A109260 A109261

Keyword

easy,nonn,less

Author

David Wasserman, Jun 23 2005

Status

approved