id:A066285 - OEIS Search Results

Search: id:A066285

Displaying 1-1 of 1 results found.

page 1

a(n) is the minimal difference between primes p and q whose sum is 2n.

+0
4

0, 0, 2, 0, 2, 0, 6, 4, 6, 0, 2, 0, 6, 4, 6, 0, 2, 0, 6, 4, 18, 0, 10, 12, 6, 8, 18, 0, 2, 0, 18, 8, 6, 12, 10, 0, 18, 4, 6, 0, 2, 0, 6, 4, 30, 0, 10, 24, 6, 16, 18, 0, 14, 24, 6, 8, 30, 0, 2, 0, 18, 8, 6, 12, 10, 0, 30, 4, 6, 0, 2, 0, 30, 8, 6, 12, 10, 0, 18, 4, 30, 0, 10, 24, 6, 28, 18, 0 (list; graph; listen)

	OFFSET	`2,3`
	MATHEMATICA	`a[n_] := For[p=n, True, p--, If[PrimeQ[p]&&PrimeQ[2n-p], Return[2n-2p]]]`
	CROSSREFS	`Cf. A065978, A066286.` `Sequence in context: A002117 A042970 A136581 this_sequence A136665 A047765 A068463` `Adjacent sequences: A066282 A066283 A066284 this_sequence A066286 A066287 A066288`
	KEYWORD	`nonn,easy`
	AUTHOR	`Dean Hickerson (dean(AT)math.ucdavis.edu), Dec 12, 2001`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research