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 A270192 #11 Jul 22 2016 10:44:13 %S A270192 2,3,5,7,10,13,17,20,24,26,28,30,33,35,41,43,45,49,52,57,60,62,64,66, %T A270192 69,72,77,79,81,83,87,89,92,94,98,104,109,113,116,120,124,126,128,132, %U A270192 135,137,140,142,144,146,148,150,152,154,156,158,162,166,171,173,176,178,182,186,190,192,196,201,206,209,212,215,220,223,225 %N A270192 Numbers n for which (prime(n+1)-prime(n)) mod 3 = 2. %H A270192 Antti Karttunen, <a href="/A270192/b270192.txt">Table of n, a(n) for n = 1..10000</a> %e A270192 2 is present as prime(3) - prime(2) = 5 - 3 = 2 = 2 modulo 3. %e A270192 24 is present as prime(24) = 89, prime(25) = 97 and 97-89 = 8 = 2 modulo 3. %t A270192 Select[Range@ 225, Mod[Prime[# + 1] - Prime@ #, 3] == 2 &] (* _Michael De Vlieger_, Mar 17 2016 *) %t A270192 Position[Differences[Prime[Range[300]]],_?(Mod[#,3]==2&)]//Flatten (* _Harvey P. Dale_, Jul 22 2016 *) %o A270192 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A270192 (define A270192 (MATCHING-POS 1 1 (lambda (n) (= 2 (A137264 n))))) %o A270192 (PARI) isok(n) = ((prime(n+1) - prime(n)) % 3) == 2; \\ _Michel Marcus_, Mar 17 2016 %Y A270192 Subsequence of A270189. %Y A270192 Positions of 2's in A137264. %Y A270192 Cf. A000040, A001223, A270190, A270191. %Y A270192 Differs from its subsequence A029707 for the first time at n=9. %K A270192 nonn %O A270192 1,1 %A A270192 _Antti Karttunen_, Mar 16 2016