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 A009299 #11 Jul 13 2013 12:01:47 %S A009299 2,6,14,30,38,62,78,86,126,158,174,182,198,230,254,318,350,366,374, %T A009299 398,422,462,470,510,518,534,638,702,734,750,758,798,846,870,902,926, %U A009299 942,950,1022,1038,1046,1070,1094,1142,1190,1206,1278,1382,1406,1446,1470,1502 %N A009299 If a, b in sequence, so is a*b+2. %H A009299 Reinhard Zumkeller, <a href="/A009299/b009299.txt">Table of n, a(n) for n = 1..1000</a> %o A009299 (Haskell) %o A009299 import Data.Set (singleton, deleteFindMin, insert) %o A009299 a009299 n = a009299_list !! (n-1) %o A009299 a009299_list = f [2] (singleton 2) where %o A009299 f xs s = m : f xs' (foldl (flip insert) s' (map ((+ 2) . (* m)) xs')) %o A009299 where xs' = m : xs %o A009299 (m,s') = deleteFindMin s %o A009299 -- _Reinhard Zumkeller_, Aug 15 2011 %Y A009299 Cf. A009293, A192476. %K A009299 nonn %O A009299 1,1 %A A009299 _David W. Wilson_