login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058067 Number of polynomial functions from Z to Z/nZ. 3

%I

%S 1,1,4,27,64,3125,108,823543,1024,19683,12500,285311670611,1728,

%T 302875106592253,3294172,84375,65536,827240261886336764177,78732,

%U 1978419655660313589123979,200000,22235661,1141246682444,20880467999847912034355032910567

%N Number of polynomial functions from Z to Z/nZ.

%C The first formula for a(n) is due to Kempner (1921). - _Jonathan Sondow_, Nov 05 2017

%H M. Bhargava, <a href="http://dx.doi.org/10.2307/2695734">The factorial function and generalizations</a>, Amer. Math. Monthly, 107 (Nov. 2000), 783-799.

%H A. 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., 22 (1921), 240-288.

%F a(n) = Product_{k=0..n-1} n/gcd(n, k!).

%F 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)). - _Andrey Zabolotskiy_, Nov 09 2017]

%F a(prime(n)) = A051674(n). - _R. J. Mathar_, Apr 01 2014 [Edited by _Andrey Zabolotskiy_, Nov 08 2017]

%F a(n) = n^n / A240098(n). - _Jonathan Sondow_, Nov 10 2017

%p A058067 := n->mul(n/gcd(n,k!),k=0..n-1);

%o (PARI) a(n) = prod(k=0, n-1, n/gcd(n, k!)); \\ _Michel Marcus_, Nov 06 2017

%Y Cf. A051674, A090622, A240098.

%K nonn,mult

%O 0,3

%A _N. J. A. Sloane_, Nov 24 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 23:39 EDT 2019. Contains 328211 sequences. (Running on oeis4.)