Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058067 Number of polynomial functions from Z to Z/nZ. +0
1
1, 1, 4, 27, 64, 3125, 108, 823543, 1024, 19683, 12500, 285311670611, 1728, 302875106592253, 3294172, 84375, 65536, 827240261886336764177, 78732, 1978419655660313589123979, 200000, 22235661, 1141246682444, 20880467999847912034355032910567 (list; graph; listen)
OFFSET

0,3

REFERENCES

M. Bhargava, The factorial function and generalizations, Amer. Math. Monthly, 107 (Nov. 2000), 783-799.

FORMULA

Product (n/gcd(n, k!), k=0..n-1).

Multiplicative with a(p^e) = p^t_p(e). - David W. Wilson, Aug 14 2005

MAPLE

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

CROSSREFS

Sequence in context: A033663 A141091 A097792 this_sequence A054412 A122405 A122406

Adjacent sequences: A058064 A058065 A058066 this_sequence A058068 A058069 A058070

KEYWORD

nonn,mult

AUTHOR

njas, Nov 24 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research