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 A079079 #18 Apr 26 2017 02:48:33
%S A079079 3,6,12,24,42,63,90,120,180,240,304,399,462,528,648,810,930,1054,1224,
%T A079079 1332,1480,1680,1890,2205,2499,2652,2808,2970,3135,3648,4224,4554,
%U A079079 4830,5250,5700,6004,6478,6888,7308,7830,8190,8736,9312,9603,9900,10600
%N A079079 a(n) = (prime(n)+1)*(prime(n+1)+1)/4.
%H A079079 Charles R Greathouse IV, <a href="/A079079/b079079.txt">Table of n, a(n) for n = 1..10000</a>
%t A079079 Table[(Prime[n] + 1)*(Prime[n + 1] + 1)/4, {n, 1, 50}] (* _G. C. Greubel_, Apr 25 2017 *)
%o A079079 (PARI) a(n)=(prime(n)+1)*(prime(n+1)+1)/4 \\ _Charles R Greathouse IV_, Aug 21 2011
%o A079079 (Haskell)
%o A079079 a079079 n = a079079_list !! (n-1)
%o A079079 a079079_list = map (`div` 4) $
%o A079079 zipWith (*) a008864_list $ tail a008864_list
%o A079079 -- _Reinhard Zumkeller_, Oct 08 2012
%o A079079 (Python)
%o A079079 from sympy import prime
%o A079079 def a(n): return (prime(n) + 1)*(prime(n + 1) + 1)/4 # _Indranil Ghosh_, Apr 26 2017
%Y A079079 Cf. A079080, A079081, A079082, A079095, smallest, greatest factor: A079083, A079084, number of factors: A079085, A079086, A079087, number, sum of divisors: A079088, A079089, sum of prime factors: A079090, A079091, Euler's totient: A079092, squarefree kernel: A079093, arithmetic derivative: A079094.
%K A079079 nonn
%O A079079 1,1
%A A079079 _Reinhard Zumkeller_, Dec 22 2002