A109257 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 prime(n).

5, 5, 7, 17, 13, 29, 19, 41, 53, 31, 67, 79, 43, 89, 97, 109, 61, 127, 137, 73, 149, 163, 173, 181, 197, 103, 211, 109, 223, 229, 257, 269, 139, 281, 151, 307, 317, 331, 337, 349, 181, 367, 193, 389, 199, 401, 433, 449, 233, 461, 479, 241, 487, 509, 521, 557

Offset

1,1

Comments

First differs from A088047 at the 49th term: prime(49) = 227, a(49) = 233, A088047(49) = 229. The next differences are at prime(n) = 347, 1667, 1697, 1787...

Links

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

Formula

a(n) = A109258(prime(n)).

Crossrefs

Cf. A088047, A088048, A109258.

Sequence in context: A264388 A141392 A088047 * A088048 A006146 A284129

Adjacent sequences: A109254 A109255 A109256 * A109258 A109259 A109260

Keyword

easy,nonn,less

Author

David Wasserman, Jun 23 2005

Status

approved