|
Search: id:A064446
|
|
|
| A064446 |
|
GCD[n!, n^n, LCM[1...n]], or GCD[n^n, LCM[1...n]]. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 12, 7, 8, 9, 40, 11, 72, 13, 56, 45, 16, 17, 144, 19, 80, 63, 176, 23, 144, 25, 208, 27, 112, 29, 10800, 31, 32, 297, 544, 175, 864, 37, 608, 351, 800, 41, 6048, 43, 352, 675, 736, 47, 864, 49, 800, 459, 416, 53, 864, 275, 1568, 513, 928, 59, 21600, 61
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
a(n)=GCD[A000142(n), A000312(n), A003418(n)]= GCD[A000312(n), A003418(n)]=GCD[A051696(n), A003418(n)]
|
|
EXAMPLE
|
n=6: a(6)=GCD[720,60,46656]=12
|
|
PROGRAM
|
(PARI) { L=1; for (n=1, 1000, L=lcm(L, n); write("b064446.txt", n, " ", gcd(n^n, L)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 14 2009]
|
|
CROSSREFS
|
Cf. A000142, A000312, A051696. Equals A003418(n)/A038610(n).
Sequence in context: A065636 A135323 A052106 this_sequence A143482 A066574 A039007
Adjacent sequences: A064443 A064444 A064445 this_sequence A064447 A064448 A064449
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 02 2001
|
|
|
Search completed in 0.002 seconds
|
