A296081 a(n) = gcd(tau(n)-1, sigma(n)-1), where tau = A000005 and sigma = A000203.
0, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 5, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 7, 1, 7, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 5, 5, 8, 1, 1, 1, 1, 1
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..16384
Programs
-
Mathematica
Array[GCD[DivisorSigma[0,#]-1,DivisorSigma[1,#]-1]&,120] (* Harvey P. Dale, Oct 18 2022 *)
-
Scheme
(define (A296081 n) (gcd (A039653 n) (A032741 n)))