This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A135557 #8 Oct 19 2016 03:05:45 %S A135557 10,20,30,40,60,80,90,100,120,140,180,200,210,220,240,320,330,340,390, %T A135557 420,450,460,490,520,540,560,600,620,630,700,720,740,780,830,900,920, %U A135557 930,990,1070,1120,1140,1180,1200,1220,1230,1260,1290,1300,1350,1360 %N 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. %H A135557 G. C. Greubel, <a href="/A135557/b135557.txt">Table of n, a(n) for n = 1..1000</a> %e A135557 3+7 == 10; 13+17 == 30; 17+23 == 40; 23+37 == 60; 37+43 == 80;... %t A135557 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 *) %Y A135557 Cf. A138019, A138018. %K A135557 easy,nonn %O A135557 1,1 %A A135557 Daniele Corradetti (d.corradetti(AT)gmail.com), Feb 28 2008 %E A135557 Edited, corrected and extended by _Robert G. Wilson v_, Feb 29 2008