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 A133490 #2 Mar 30 2012 17:39:26
%S A133490 2,0,23,53,211,211,211,1341,1343,2179,3967,15705,16033,19635,24281,
%T A133490 24281,31429,31431,31433,38501,38501,58831,203713,206699,206699,
%U A133490 370311,370313,370315,370317,1272749,1272749,1272749,1357265,1357267,2010801
%N A133490 Smallest number at distance 2n from nearest prime (variant 3).
%C A133490 Let f(m) be the distance to the nearest prime as defined in A051700(m). Then a(n) = min { m: f(m)>= 2n}. The variants of a different definition of "distance" or demanding equality, f(m)=2n, are in A132860 and A051728.
%K A133490 nonn
%O A133490 0,1
%A A133490 _R. J. Mathar_, Nov 30 2007