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 A302976 #11 Jul 13 2025 19:16:50
%S A302976 0,0,8,17,7,208,30,0,0,8576,112,0,80,22864,36199,159681,155,0,116,
%T A302976 40062976,83791,142928,255,26138902528,68,302656,362152,454885376,60,
%U A302976 544999124224,374,0,226279,629152,399674,27234498115233,76,956704,956539,3361080344576
%N A302976 a(n) = tau(n)^n mod n^tau(n).
%C A302976 tau(n) = the number of the divisors of n (A000005).
%C A302976 tau(n)^n > n^tau(n) for all n > 3.
%F A302976 a(n) = A000005(n)^n mod n^A000005(n) = A302974(n) mod A302975(n).
%F A302976 a(A120737(n)) = 0.
%e A302976 For n = 8; a(8) = 0 because tau(8)^8 mod 8^tau(8) = 4^8 mod 8^4 = 65536 mod 4096 = 0.
%t A302976 PowerMod[#[[2]],#[[1]],#[[1]]^#[[2]]]&/@Table[{n,DivisorSigma[0,n]},{n,40}] (* _Harvey P. Dale_, Jan 08 2023 *)
%o A302976 (Magma) [(NumberOfDivisors(n)^n) mod (n^NumberOfDivisors(n)): n in[1..100]];
%Y A302976 Cf. A000005, A120737, A302974, A302975.
%K A302976 nonn
%O A302976 1,3
%A A302976 _Jaroslav Krizek_, Apr 16 2018