This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 2
 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 (list; graph; refs; listen; history; text; internal format)
 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 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 13:37 EDT 2019. Contains 327253 sequences. (Running on oeis4.)