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 A049488 #33 May 19 2016 04:12:45 %S A049488 3,7,13,31,37,43,67,73,97,151,157,163,181,211,223,241,277,331,337,367, %T A049488 373,433,463,487,541,547,571,577,601,631,643,661,727,757,811,823,937, %U A049488 967,997,1033,1087,1093,1171,1201,1213,1291,1303,1423,1471,1483,1543 %N A049488 Primes p such that p+16 is prime. %C A049488 Using the Elliott-Halberstam conjecture, Goldston et al. prove that there are an infinite number of primes here. - _T. D. Noe_, Nov 26 2013 %D A049488 P. D. T. A. Elliott and H. Halberstam, A conjecture in prime number theory, Symposia Mathematica, Vol. IV (INDAM, Rome, 1968/69), pages 59-72, Academic Press, London, 1970. %H A049488 Seiichi Manyama, <a href="/A049488/b049488.txt">Table of n, a(n) for n = 1..10000</a> (terms up to a(1000) by T. D. Noe) %H A049488 D. A. Goldston, J. Pintz, and C. Y. Yildirim, <a href="http://arxiv.org/abs/math.NT/0508185">Primes in Tuples I</a>, arXiv:math/0508185 [math.NT], Aug 10 2005. %H A049488 A. Granville and G. Martin, <a href="http://www.arXiv.org/abs/math.NT/0408319">Prime number races</a>, arXiv:math/0408319 [math.NT], Aug 24 2004. %e A049488 7 and 7+16=23 are prime. %t A049488 Select[Range[1000], PrimeQ[#] && PrimeQ[#+16]&] (* _Vladimir Joseph Stephan Orlovsky_, Dec 25 2008 *) %t A049488 Select[Prime[Range[250]],PrimeQ[#+16 ]&] (* _Harvey P. Dale_, Oct 30 2015 *) %o A049488 (PARI) select(p->isprime(p+16),primes(100)) \\ _Charles R Greathouse IV_, Jul 08 2013 %Y A049488 Cf. A001359, A023200, A023202. %K A049488 nonn,easy %O A049488 1,1 %A A049488 _Labos Elemer_