id:A109258 - OEIS Search Results

Search: id:A109258

Displaying 1-1 of 1 results found.

page 1

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.

+0
2

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 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Cf. A109257.` `Sequence in context: A079578 A066169 A087821 this_sequence A088081 A138475 A023840` `Adjacent sequences: A109255 A109256 A109257 this_sequence A109259 A109260 A109261`
	KEYWORD	`easy,nonn,less`
	AUTHOR	`David Wasserman (wasserma(AT)spawar.navy.mil), Jun 23 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research