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 A007708 #18 Jun 29 2019 19:49:38
%S A007708 5,13,31,73,149,233,367,521,733,991,1249,1579,1949,2341,2791,3343,
%T A007708 3881,4481,5147,5849,6619,7499,8387,9341,10321,11411,12517,13709,
%U A007708 15013,16363,17881,19381,20873,22369,24007,25763,27611,29399,31357
%N A007708 Prime(n)*...*a(n) is the least product of consecutive primes which is abundant.
%C A007708 Differs from A007686 only for n=1. - _Michel Marcus_, Mar 10 2013
%H A007708 Amiram Eldar, <a href="/A007708/b007708.txt">Table of n, a(n) for n = 1..1000</a>
%t A007708 a[n_] := Module[{p = Prime[n]}, r = 1 + 1/p; While[r <= 2, p = NextPrime[p]; r *= 1 + 1/p]; p]; Array[a, 39] (* _Amiram Eldar_, Jun 29 2019 *)
%o A007708 (PARI) a(n) = {p = prime(n); sig = p+1; prd = p; while (sig <= 2*prd, p = nextprime(p+1); sig *= p+1; prd *= p;); return (p);} \\ _Michel Marcus_, Mar 10 2013
%Y A007708 Cf. A005101, A007686, A007707, A007741.
%K A007708 nonn
%O A007708 1,1
%A A007708 _Walter Nissen_
%E A007708 More terms from _Don Reble_, Nov 10 2005