|
| |
|
|
A072046
|
|
Greatest common divisor of product of divisors of n and product of non-divisors < n.
|
|
3
|
|
|
|
1, 1, 1, 1, 1, 4, 1, 2, 3, 4, 1, 144, 1, 4, 45, 32, 1, 72, 1, 320, 63, 4, 1, 82944, 125, 4, 729, 448, 1, 162000, 1, 32768, 99, 4, 1225, 3359232, 1, 4, 117, 2560000, 1, 63504, 1, 704, 91125, 4, 1, 254803968, 343, 125000, 153, 832, 1, 8503056, 3025, 9834496, 171, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,6
|
|
|
COMMENTS
|
a(n) = GCD(A007955(n), A055067(n)).
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
|
a(12) = GCD(A007955(12), A055067(12)) = GCD(1*2*3*4*6*12,5*7*8*9*10*11) = GCD(1728,277200) = 144;
a(13) = GCD(A007955(13), A055067(13)) = GCD(1*13,2*3*4*5*6*7*8*9*10*11*12) = GCD(13,479001600) = 1.
|
|
|
MATHEMATICA
|
a[n_] := (dd = Divisors[n]; GCD[Times @@ dd, Times @@ Complement[Range[n], dd]]); Array[a, 59]
|
|
|
PROG
|
(Haskell)
a072046 n = gcd (a007955 n) (a055067 n)
-- Reinhard Zumkeller, Feb 06 2012
|
|
|
CROSSREFS
|
Sequence in context: A090204 A156915 A212497 * A123609 A215645 A075617
Adjacent sequences: A072043 A072044 A072045 * A072047 A072048 A072049
|
|
|
KEYWORD
|
nonn,nice
|
|
|
AUTHOR
|
Reinhard Zumkeller, Jul 29 2002
|
|
|
STATUS
|
approved
|
| |
|
|
