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 A261700 #19 Jun 24 2016 14:53:26 %S A261700 1267650600228229401496703205376, %T A261700 515377520732011331036461129765621272702107522001, %U A261700 7888609052210118054117285652827862296732064351090230047702789306640625,3234476509624757991344647769100216810857203198904625400933895331391691459636928060001 %N A261700 Numbers with 101 divisors. %C A261700 Also, 100th powers of primes. %C A261700 The n-th number with p divisors is equal to the n-th prime raised to power p-1, where p is prime. %H A261700 OEIS Wiki, <a href="https://oeis.org/wiki/Index_entries_for_number_of_divisors">Index entries for number of divisors</a> %F A261700 a(n) = A000040(n)^(101-1) = A000040(n)^100. %F A261700 A000005(a(n)) = 101. %e A261700 a(1) = 2^100, a(2) = 3^100, a(3) = 5^100, a(4) = 7^100. %o A261700 (PARI) a(n)=prime(n)^100 \\ _Charles R Greathouse IV_, Jun 19 2016 %Y A261700 Cf. A000005, A000040, A001248, A030514, A030516, A030629, A030631, A030635, A030637, A137486, A137492, A139571, A139572, A139573, A139574, A139575, A173533, A183062, A183085. %K A261700 nonn,easy %O A261700 1,1 %A A261700 _Omar E. Pol_, Aug 28 2015