A296083 -id:A296083 - cp's OEIS frontend

A296082 a(1) = 0; for n > 1, a(n) = A032741(n) / gcd(A039653(n),A032741(n)).

0, 1, 1, 1, 1, 3, 1, 3, 1, 3, 1, 5, 1, 3, 3, 2, 1, 5, 1, 5, 3, 3, 1, 7, 1, 3, 1, 1, 1, 7, 1, 5, 3, 3, 3, 4, 1, 3, 3, 7, 1, 7, 1, 5, 5, 3, 1, 3, 1, 5, 3, 5, 1, 1, 3, 1, 3, 3, 1, 11, 1, 3, 5, 1, 3, 7, 1, 1, 3, 7, 1, 11, 1, 3, 5, 5, 3, 7, 1, 9, 1, 3, 1, 11, 3, 3, 3, 7, 1, 11, 1, 5, 3, 3, 3, 11, 1, 1, 1, 1, 1, 7, 1, 7, 7

Offset: 1

Antti Karttunen, Dec 05 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A032741, A039653, A296081, A296083, A296084.

Cf. A284288 (positions of ones).

(define (A296082 n) (if (= 1 n) 0 (/ (A032741 n) (gcd (A039653 n) (A032741 n)))))

a(1) = 0; for n > 1, a(n) = A032741(n) / gcd(A039653(n),A032741(n)) = A032741(n)/A296081(n).

a(n) = 1 iff A296084(n) = 1.

A296081 a(n) = gcd(tau(n)-1, sigma(n)-1), where tau = A000005 and sigma = A000203.

Original entry on oeis.org

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

Antti Karttunen, Dec 05 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A032741, A039653, A065608, A284288, A296082, A296083.

Cf. also A009205.

Array[GCD[DivisorSigma[0,#]-1,DivisorSigma[1,#]-1]&,120] (* Harvey P. Dale, Oct 18 2022 *)

(define (A296081 n) (gcd (A039653 n) (A032741 n)))

a(n) = gcd(A032741(n), A039653(n)).

a(n) = gcd(A039653(n), A065608(n)).

cp's OEIS Frontend

A296082 a(1) = 0; for n > 1, a(n) = A032741(n) / gcd(A039653(n),A032741(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula