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 A137609 #2 Mar 30 2012 17:22:47 %S A137609 5,15,36,91,145,305,476,729,408,1295,1796,1072,1370,1749,2226,2816, %T A137609 3426,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149, %U A137609 151,157,163,167,173,179,181,191,193,197,199,211,223,227,229 %N A137609 Consider a line in n-space given parametrically by y(t)=v*t, where v is the vector (2,3,5,..prime(n)). Let t0>0 be the least value of t such that y(t0) is closest to an integer point not on the line y(t). a(n) is t0 times v.v. %C A137609 See A059804 for the distance from y(t0) to the integer point. Observe that for n >= 19, a(n) = prime(n). For n >= 19, the closest integer point is (0,0,0,..,0,1). %K A137609 nonn %O A137609 2,1 %A A137609 _T. D. Noe_, Jan 29 2008