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 A076962 #11 May 15 2014 10:28:51
%S A076962 0,3,25,14,14641,52,24137569,114,2116,464,819628286980801,444,
%T A076962 22563490300366186081,2752,35344,1272,21559177407076402401757871041,
%U A076962 2196,740195513856780056217081017732809,3408,341056,80896,1658509762573818415340429240403156732495289,5340
%N A076962 Smallest multiple of prime(n) with n divisors, or 0 if no such number exists.
%C A076962 If p is a prime then a(p) = prime(p)^(p-1).
%C A076962 No entry is zero for n>1, since prime(n)^(n-1) has exactly n divisors. When n is not prime, this will generally be greater than a(n), but it suffices to prove existence. - _Franklin T. Adams-Watters_, May 14 2014
%o A076962 (PARI) a(n) = {if (n==1, return (0)); if (isprime(n), return (prime(n)^(n-1))); np = prime(n); mnp = np; while (numdiv(mnp) != n, mnp += np;); return (mnp);} \\ _Michel Marcus_, Mar 19 2013
%Y A076962 Cf. A076961.
%K A076962 nonn
%O A076962 1,2
%A A076962 _Amarnath Murthy_, Oct 21 2002
%E A076962 Corrected and extended by _Sascha Kurz_, Jan 22 2003
%E A076962 More terms from _Michel Marcus_, Mar 19 2013