A135557 Consider the primes which are congruent to 2 or 3 modulo 5. List the sum of any consecutive pair if that sum is congruent to 0 modulo 10.

10, 20, 30, 40, 60, 80, 90, 100, 120, 140, 180, 200, 210, 220, 240, 320, 330, 340, 390, 420, 450, 460, 490, 520, 540, 560, 600, 620, 630, 700, 720, 740, 780, 830, 900, 920, 930, 990, 1070, 1120, 1140, 1180, 1200, 1220, 1230, 1260, 1290, 1300, 1350, 1360

Offset: 1

Author

Daniele Corradetti (d.corradetti(AT)gmail.com), Feb 28 2008

Keywords

• easy
• nonn

Examples

			3+7 == 10; 13+17 == 30; 17+23 == 40; 23+37 == 60; 37+43 == 80;...
		

Links

• G. C. Greubel, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A138019, A138018.

Programs

Mathematica

Select[ Plus @@@ Partition[ Select[ Prime@ # & /@ Range@125, Mod[ #, 5] == 2 || Mod[ #, 5] == 3 &], 2, 1], Mod[ #, 10] == 0 &] (* Robert G. Wilson v, Feb 29 2008 *)

Extensions

Edited, corrected and extended by Robert G. Wilson v, Feb 29 2008