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 A280298 #11 Jan 01 2017 02:31:23
%S A280298 73786976294838206464,30903154382632612361920641803529,
%T A280298 13552527156068805425093160010874271392822265625,
%U A280298 59768263894155949306790119265585619217025149412430681649,539407797827634189900210968137750826278309533633974732577186113975161
%N A280298 Numbers with 67 divisors.
%C A280298 Also, 66th powers of primes.
%C A280298 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 = 67.
%H A280298 OEIS Wiki, <a href="https://oeis.org/wiki/Index_entries_for_number_of_divisors">Index entries for number of divisors</a>
%F A280298 a(n) = A000040(n)^(67-1) = A000040(n)^66.
%F A280298 A000005(a(n)) = 67.
%e A280298 a(1) = 2^66, a(2) = 3^66, a(3) = 5^66, a(4) = 7^66, a(5) = 11^66.
%t A280298 Array[Prime[#]^66 &, {5}] (* _Michael De Vlieger_, Dec 31 2016 *)
%o A280298 (PARI) a(n)=prime(n)^66
%Y A280298 Cf. A000005, A000040, A001248, A030514, A030516, A030629, A030631, A030635, A030637, A137486, A137492, A139571, A139572, A139573, A139574, A139575, A173533, A183062, A183085, A280299, A280301, A261700.
%K A280298 nonn,easy
%O A280298 1,1
%A A280298 _Omar E. Pol_, Dec 31 2016