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 A261210 #24 Aug 26 2015 02:14:37
%S A261210 2311,1877,163,80831,12647,6967,139,3633983,1657,15473,2970049,933853,
%T A261210 64776587,99767,21067,84961,1524137,820319,157229,489427,2066140207,
%U A261210 71899,15287,1680583,769117,55732973,52889,225941,4678959379,1491686591,87701
%N A261210 a(n) = gpf(1 + Product_{k=0..4} prime(n+k)), where gpf is greatest prime factor and prime(i) is the i-th prime.
%H A261210 Anders Hellström, <a href="/A261210/b261210.txt">Table of n, a(n) for n = 1..1000</a>
%F A261210 a(n) = A006530(1+A046303(n)). - _Michel Marcus_, Aug 13 2015
%t A261210 Array[FactorInteger[1 + Product[Prime[# + k], {k, 0, 4}]][[-1, 1]] &, {31}] (* _Michael De Vlieger_, Aug 19 2015 *)
%o A261210 (PARI) gpf(n)=vecmax(factor(n)[, 1]);
%o A261210 first(m)=vector(m, i, gpf(1+prod(j=0,4,prime(i+j))));
%Y A261210 Cf. A006530, A046303.
%K A261210 nonn
%O A261210 1,1
%A A261210 _Anders Hellström_, Aug 12 2015