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 A100742 #7 Jun 16 2013 10:38:27
%S A100742 2,3,5,3,3,13,5,3,3,5,3,37,5,3,11,5,3,13,7,3,13,3,3,5,37,5,3,11,13,5,
%T A100742 7,3,5,3,17,7,37,3,11,5,23,13,3,13,5,3,3,3,47,73,29,23,13,3,5,11,5,3,
%U A100742 37,17,19,5,7,3,13,17,3,61,11,13,5,3,19,13,3,3,5,61,53,13,3,37,23,13,7,3,5
%N A100742 Smallest prime p such that (p+prime(n))/2 is prime.
%o A100742 (PARI) a(n) = {if (n==1, return (2)); p = 3; while(! isprime((prime(n)+p)/2), p = nextprime(p+1)); return (p);} \\ _Michel Marcus_, Jun 16 2013
%Y A100742 Cf. A084704.
%K A100742 easy,nonn,less
%O A100742 1,1
%A A100742 _David Wasserman_, Jan 03 2005