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!)
A062763 a(n) is the greatest common divisor of (n-1)! and n^n. 3
1, 1, 1, 2, 1, 24, 1, 16, 9, 640, 1, 20736, 1, 7168, 6075, 2048, 1, 23887872, 1, 8192000, 321489, 2883584, 1, 10319560704, 625, 54525952, 59049, 2877292544, 1, 835884417024000000, 1, 67108864, 578739249, 36507222016, 187578125, 61628086298345472, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

a(n) = 1 iff n is 1 or a prime.

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..300

FORMULA

a(n) = A051696(n)/n.

EXAMPLE

a(10) = gcd(9!, 10^10) = gcd(2^7*3^4*5*7, 2^10*5^10) = 2^7*5 = 640.

PROG

(PARI) a(n)=gcd((n-1)!, n^n); \\ Harry J. Smith, Aug 10 2009

CROSSREFS

Cf. A051696.

Sequence in context: A345262 A108778 A271530 * A243147 A261407 A037943

Adjacent sequences: A062760 A062761 A062762 * A062764 A062765 A062766

KEYWORD

nonn

AUTHOR

Henry Bottomley, Jul 16 2001

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 March 31 19:11 EDT 2023. Contains 361672 sequences. (Running on oeis4.)