[go: up one dir, main page]

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

%I #6 Dec 05 2017 21:23:04

%S 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,

%T 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,

%U 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

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

%H Antti Karttunen, <a href="/A296082/b296082.txt">Table of n, a(n) for n = 1..16384</a>

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

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

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

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

%Y Cf. A284288 (positions of ones).

%K nonn

%O 1,6

%A _Antti Karttunen_, Dec 05 2017