editing
approved
editing
approved
If k(m) is the m-th divisor (when the divisors are ordered by size) of n, then a(n) = GCDgcd(k(1)+k(2), k(2)+k(3), k(3)+k(4), ..., k(j-1)+k(j)), where j is the number of divisors of n.
The divisors of 14 are 1,2,7,14. So a(14) = GCDgcd(1+2, 2+7, 7+14) = 3.
approved
editing
editing
approved
Harvey P. Dale, <a href="/A104076/b104076.txt">Table of n, a(n) for n = 2..1000</a>
approved
editing
editing
approved
Table[GCD@@(Total/@Partition[Divisors[n], 2, 1]), {n, 2, 100}] (* Harvey P. Dale, Dec 18 2018 *)
approved
editing
editing
approved
If k(m) is the m-th divisor (when the divisors are ordered by size) of n, then a(n) = GCD(k(1)+k(2), k(2)+k(3), k(3)+k(4), ..., k(j-1)+k(j)), where j is the number of divisors of n.
The divisors of 14 are 1,2,7,14. So a(14) = GCD(1+2, 2+7, 7+14) = 3.
Corrected definition. - _Definition corrected by _Leroy Quet_, Sep 21 2008
approved
editing
Corrected definition. - Leroy Quet , Sep 21 2008
Leroy Quet , Aug 31 2008