OFFSET
0,2
COMMENTS
a(n) exists for every n. In other words, every positive odd integer k is equal to the GCD of d(m^2) and d(m) for some m. To see this, let m = 2^(k^2 - 1) * 3^((k-1)/2). Then d(m) = k^2 * (k+1)/2 and d(m^2) = (2 k^2 - 1) * k. Both of these are divisible by k and (8k-4) d(m) - (2k+1) d(m^2) = k, so the GCD is k. - Dean Hickerson, Jun 23 2001
All the terms are in A025487 because A061680(m) = gcd(d(m^2), d(m)) depends only on the prime signature of m. - Amiram Eldar, Nov 26 2023
LINKS
Amiram Eldar, Table of n, a(n) for n = 0..28
FORMULA
a(n) = Min[m : GCD[d(m^2), d(m)] = 2n+1].
EXAMPLE
For n = 7, GCD[d(20736),d(144)] = GCD[45,15] = 15 = 2*7+1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 18 2001
EXTENSIONS
More terms from David Wasserman, Jun 20 2002
a(12)-a(13) corrected and a(17)-a(20) added by Amiram Eldar, Nov 26 2023
STATUS
approved