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,6

Links

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

Formula

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.

Prog

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

Crossrefs

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

Cf. A284288 (positions of ones).

Sequence in context: A205526 A233269 A035689 * A294786 A294787 A294788

Adjacent sequences: A296079 A296080 A296081 * A296083 A296084 A296085

Keyword

nonn

Author

Antti Karttunen, Dec 05 2017

Status

approved