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 A058067 #48 Jun 06 2021 02:56:28
%S A058067 1,1,4,27,64,3125,108,823543,1024,19683,12500,285311670611,1728,
%T A058067 302875106592253,3294172,84375,65536,827240261886336764177,78732,
%U A058067 1978419655660313589123979,200000,22235661,1141246682444,20880467999847912034355032910567
%N A058067 Number of polynomial functions from Z to Z/nZ.
%C A058067 The first formula for a(n) is due to Kempner (1921). - _Jonathan Sondow_, Nov 05 2017
%H A058067 Amiram Eldar, <a href="/A058067/b058067.txt">Table of n, a(n) for n = 0..388</a>
%H A058067 Manjul Bhargava, <a href="http://dx.doi.org/10.2307/2695734">The factorial function and generalizations</a>, Amer. Math. Monthly, Vol. 107, No. 9 (Nov. 2000), pp. 783-799; <a href="https://www.jstor.org/stable/2695734">alternative link</a>,
%H A058067 Aubrey J. Kempner, <a href="https://doi.org/10.1090/S0002-9947-1921-1501173-4">Polynomials and their residue systems</a>, <a href="https://doi.org/10.1090/S0002-9947-1921-1501174-6">continued</a>, Amer. Math. Soc. Trans., Vol. 22 (1921), pp. 240-288.
%H A058067 David Singmaster, <a href="https://doi.org/10.1016/0022-314X(74)90031-6">On polynomial functions (mod m)</a>, Journal of Number Theory, Volume 6, Issue 5, October 1974, pp. 345-352.
%F A058067 a(n) = Product_{k=0..n-1} n/gcd(n, k!).
%F A058067 Multiplicative with a(p^e) = p^t_p(e). - _David W. Wilson_, Aug 14 2005 [t_p(e) = Sum_{k>=0: e > A090622(k, p)} (e - A090622(k, p)) = p * Sum_{k = 1..e} max(0, k - A090622(e-k, p)). In particular, t_p(e) = p*e*(e+1)/2 for e <= p. - _Andrey Zabolotskiy_, Nov 09 2017 and Sep 29 2020]
%F A058067 a(prime(n)) = A051674(n). - _R. J. Mathar_, Apr 01 2014 [Edited by _Andrey Zabolotskiy_, Nov 08 2017]
%F A058067 a(n) = n^n / A240098(n). - _Jonathan Sondow_, Nov 10 2017
%p A058067 A058067 := n->mul(n/gcd(n,k!),k=0..n-1);
%t A058067 a[0] = 1; a[n_] := Product[n/GCD[n, k!], {k, 0, n - 1}]; Array[a, 24, 0] (* _Amiram Eldar_, Sep 29 2020 *)
%o A058067 (PARI) a(n) = prod(k=0, n-1, n/gcd(n, k!)); \\ _Michel Marcus_, Nov 06 2017
%Y A058067 Cf. A051674, A090622, A240098.
%K A058067 nonn,mult,easy
%O A058067 0,3
%A A058067 _N. J. A. Sloane_, Nov 24 2000