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 A280299 #11 Jan 01 2017 02:31:31
%S A280299 1180591620717411303424,2503155504993241601315571986085849,
%T A280299 8470329472543003390683225006796419620513916015625,
%U A280299 143503601609868434285603076356671071740077383739246066639249,7897469567994392174328988784504809847540729881935024059662581894710332201
%N A280299 Numbers with 71 divisors.
%C A280299 Also, 70th powers of primes.
%C A280299 More generally, the n-th number with p divisors is equal to the n-th prime raised to power p-1, where p is prime. In this case, p = 71.
%H A280299 OEIS Wiki, <a href="https://oeis.org/wiki/Index_entries_for_number_of_divisors">Index entries for number of divisors</a>
%F A280299 a(n) = A000040(n)^(71-1) = A000040(n)^70.
%F A280299 A000005(a(n)) = 71.
%e A280299 a(1) = 2^70, a(2) = 3^70, a(3) = 5^70, a(4) = 7^70, a(5) = 11^70.
%t A280299 Array[Prime[#]^70 &, {5}] (* _Michael De Vlieger_, Dec 31 2016 *)
%o A280299 (PARI) a(n)=prime(n)^70
%Y A280299 Cf. A000005, A000040, A001248, A030514, A030516, A030629, A030631, A030635, A030637, A137486, A137492, A139571, A139572, A139573, A139574, A139575, A173533, A183062, A183085, A280298, A280301, A261700.
%K A280299 nonn,easy
%O A280299 1,1
%A A280299 _Omar E. Pol_, Dec 31 2016