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 A036878 #48 Feb 17 2024 10:28:20
%S A036878 2,9,625,117649,25937424601,23298085122481,48661191875666868481,
%T A036878 104127350297911241532841,907846434775996175406740561329,
%U A036878 88540901833145211536614766025207452637361,550618520345910837374536871905139185678862401
%N A036878 a(n) = p^(p-1) where p = prime(n).
%C A036878 Also the least refactorable number (A033950) that has the n-th prime as its least prime factor. - _Robert G. Wilson v_, Jun 28 2006
%H A036878 Vincenzo Librandi, <a href="/A036878/b036878.txt">Table of n, a(n) for n = 1..77</a>
%H A036878 S. Colton, <a href="http://www.cs.uwaterloo.ca/journals/JIS/colton/joisol.html">Refactorable Numbers - A Machine Invention</a>, J. Integer Sequences, Vol. 2, 1999, #2.
%H A036878 S. Colton, <a href="http://www.dai.ed.ac.uk/homes/simonco/research/hr/">HR - Automatic Theory Formation in Pure Mathematics</a>
%e A036878 5^(5-1) = 5^4 = 625.
%t A036878 Table[Prime@n^(Prime@n - 1), {n, 10}] (* _Robert G. Wilson v_, Jun 28 2006 *)
%t A036878 #^(#-1)&/@Prime[Range[10]] (* _Harvey P. Dale_, Oct 23 2015 *)
%o A036878 (Magma) [p^(p-1): p in PrimesUpTo(50)]; // _Vincenzo Librandi_, Mar 27 2014
%o A036878 (PARI) a(n) = my(p=prime(n)); p^(p-1); \\ _Michel Marcus_, Jan 24 2019
%Y A036878 These integers are refactorable -- i.e., the number of divisors divides the number itself, cf. A033950.
%Y A036878 Subset of A062981. Subsequence of A000169.
%Y A036878 Subsequence of A111134 and A246655.
%K A036878 nonn,easy
%O A036878 1,1
%A A036878 Simon Colton (simonco(AT)cs.york.ac.uk)