Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062763
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062763 Greatest common divisor of (n-1)! and n^n. +0
2
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 (list; graph; listen)
OFFSET

1,4

COMMENT

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

PROGRAM

(PARI) { for (n=1, 300, if (n>1, f*=(n - 1), f=1); write("b062763.txt", n, " ", gcd(f, n^n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 10 2009]

CROSSREFS

Sequence in context: A127607 A059360 A108778 this_sequence A037943 A073876 A119828

Adjacent sequences: A062760 A062761 A062762 this_sequence A062764 A062765 A062766

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jul 16 2001

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 December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research