login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A093394
a(n) is the GCD of n and the product of the anti-divisors of n.
2
1, 1, 1, 2, 1, 1, 3, 2, 1, 4, 1, 2, 15, 1, 1, 6, 1, 4, 21, 2, 1, 8, 5, 2, 27, 4, 1, 30, 1, 1, 33, 2, 35, 12, 1, 2, 39, 8, 1, 42, 1, 4, 45, 2, 1, 16, 7, 10, 51, 4, 1, 54, 55, 8, 57, 2, 1, 60, 1, 2, 63, 1, 65, 66, 1, 4, 69, 70, 1, 24, 1, 2, 75, 4
OFFSET
3,4
COMMENTS
See A066272 for definition of anti-divisor.
FORMULA
a(n) = gcd(n, A091507(n)).
EXAMPLE
The anti-divisors of 18 are 4, 5, 7, 12. Hence a(18) = gcd(4*5*7*12, 18) = 6.
CROSSREFS
KEYWORD
nonn
AUTHOR
Lior Manor, Mar 28 2004
STATUS
approved