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 A132350 #30 Jun 01 2018 15:31:57
%S A132350 1,1,1,0,1,1,1,0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,0,1,0,1,1,1,1,0,1,1,
%T A132350 1,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,
%U A132350 1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0
%N A132350 If n > 1 is a k-th power with k >= 2 then a(n) = 0, otherwise a(n) = 1.
%H A132350 Antti Karttunen, <a href="/A132350/b132350.txt">Table of n, a(n) for n = 1..10000</a>
%F A132350 a(n) = 1 - A075802(n) for n >= 2. - _R. J. Mathar_, Nov 12 2007
%F A132350 Given the Möbius function mu(n) = A008683(n), a(n) = abs(mu(n)) unless n is in A303946. - _Alonso del Arte_, May 28 2018
%e A132350 a(4) = 0 because 4 = 2^2.
%e A132350 a(8) = 0 because 8 = 2^3.
%e A132350 a(12) = 1 because 12 is not a perfect power (though it is divisible by a perfect power).
%t A132350 Table[Boole[GCD@@FactorInteger[n][[All, 2]] == 1], {n, 100}] (* _Alonso del Arte_, May 28 2018 *)
%o A132350 (PARI) (a(n)=!ispower(n)); (r(nMax) = for(j=1,nMax,print1(!ispower(j)","))); r(100)
%o A132350 (Haskell)
%o A132350 a132350 1 = 1
%o A132350 a132350 n = 1 - a075802 n -- _Reinhard Zumkeller_, Jun 14 2013
%Y A132350 Cf. A132349, A132351, A132352, A075802, A001597.
%K A132350 nonn
%O A132350 1,1
%A A132350 _N. J. A. Sloane_, Nov 11 2007
%E A132350 Edited by _M. F. Hasler_, Jun 01 2018