This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A296082 #6 Dec 05 2017 21:23:04 %S A296082 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 A296082 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 A296082 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 A296082 a(1) = 0; for n > 1, a(n) = A032741(n) / gcd(A039653(n),A032741(n)). %H A296082 Antti Karttunen, <a href="/A296082/b296082.txt">Table of n, a(n) for n = 1..16384</a> %F A296082 a(1) = 0; for n > 1, a(n) = A032741(n) / gcd(A039653(n),A032741(n)) = A032741(n)/A296081(n). %F A296082 a(n) = 1 iff A296084(n) = 1. %o A296082 (Scheme) (define (A296082 n) (if (= 1 n) 0 (/ (A032741 n) (gcd (A039653 n) (A032741 n))))) %Y A296082 Cf. A032741, A039653, A296081, A296083, A296084. %Y A296082 Cf. A284288 (positions of ones). %K A296082 nonn %O A296082 1,6 %A A296082 _Antti Karttunen_, Dec 05 2017