login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061774 a(n) = (n-1)!, as n runs through the prime powers >= 1. 0
1, 1, 2, 6, 24, 720, 5040, 40320, 3628800, 479001600, 1307674368000, 20922789888000, 6402373705728000, 1124000727777607680000, 620448401733239439360000, 403291461126605635584000000, 304888344611713860501504000000, 265252859812191058636308480000000, 8222838654177922817725562880000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
S. Konyagin and F. Pappalardi, Enumerating permutation polynomials over finite fields by degree, Finite Fields Appl., 8 (2002), 548-553.
FORMULA
a(n) = (A000961(n)-1)!. - Sean A. Irvine, Mar 05 2023
CROSSREFS
Cf. A000961.
Sequence in context: A277423 A191460 A073475 * A110729 A088258 A227886
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Dec 10 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 12:13 EDT 2024. Contains 372170 sequences. (Running on oeis4.)