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 A031936 #22 Apr 30 2024 05:44:46 %S A031936 523,1069,1259,1381,1759,1913,2161,2503,2861,3803,3889,4159,4373,4423, %T A031936 4463,4603,4703,4733,5059,5209,5483,6011,6229,6451,6529,6581,6619, %U A031936 7159,7351,7393,7433,7459,7621,7883,8191,8761,9109,9293,9749 %N A031936 Lower prime of a difference of 18 between consecutive primes. %C A031936 Subsequence of A153418: a(1)=523=A153418(46), a(2)=1069=A153418(80), etc. - _Zak Seidov_, Sep 13 2015 %C A031936 No terms are congruent to 7 mod 10. - _Michel Marcus_, Sep 14 2015 %H A031936 Charles R Greathouse IV, <a href="/A031936/b031936.txt">Table of n, a(n) for n = 1..10000</a> %H A031936 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a> %F A031936 a(n) = prime(A320707(n)). - _R. J. Mathar_, Apr 30 2024 %t A031936 Transpose[Select[Partition[Prime[Range[1300]], 2, 1], Last[#] - First[#] == 18 &]][[1]] (* _Bruno Berselli_, Apr 09 2013 *) %o A031936 (Magma) [p: p in PrimesUpTo(10000) | NextPrime(p)-p eq 18]; // _Bruno Berselli_, Apr 09 2013 %o A031936 (PARI) isok(p) = isprime(p) && (nextprime(p+1) == p+18); \\ _Michel Marcus_, Sep 14 2015 %Y A031936 Cf. A153418. %K A031936 nonn %O A031936 1,1 %A A031936 _Jeff Burch_