|
| |
|
|
A038610
|
|
Least common multiple of integers less than and prime to n.
|
|
8
| |
|
|
1, 1, 2, 3, 12, 5, 60, 105, 280, 63, 2520, 385, 27720, 6435, 8008, 45045, 720720, 85085, 12252240, 2909907, 3695120, 1322685, 232792560, 37182145, 1070845776, 128707425, 2974571600, 717084225, 80313433200, 215656441, 2329089562800
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| If n is a prime power, tau(a(n)) is the number of times n occurs in A034699. (If n is not a prime power, it does not occur in A034699.) - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 01 2008
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..200
|
|
|
EXAMPLE
| Since 1, 5, 7, and 11 are relatively prime to 12, a(12) = LCM(1,5,7,11) = 385.
|
|
|
MAPLE
| A038610 := n -> ilcm(op(select(k->igcd(n, k)=1, [$1..n]))); # Peter Luschny, Jun 25 2011
|
|
|
MATHEMATICA
| Table[ LCM@@ Flatten[ Position[ GCD[ n, # ]& /@ Range[ n ], 1 ] ], {n, 32} ]
|
|
|
PROG
| (PARI) a(n) = local(r); r=1; for(i=1, n-1, if(gcd(i, n)==1, r=lcm(r, i))); r - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 01 2008
(Haskell)
a038610 n = foldl lcm 1 [x | x <- [2..n-1], gcd x n == 1]
-- Reinhard Zumkeller, Oct 04 2011
|
|
|
CROSSREFS
| Cf. A034699, A000005.
Sequence in context: A069220 A062957 A124444 * A056819 A124442 A088611
Adjacent sequences: A038607 A038608 A038609 * A038611 A038612 A038613
|
|
|
KEYWORD
| nonn,nice
|
|
|
AUTHOR
| wouter.meeussen(AT)pandora.be
|
| |
|
|
