|
%I #13 Sep 16 2023 07:43:30
%S 1,0,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,0,1,1,0,1,0,1,1,0,1,0,0,1,0,1,
%T 0,1,0,1,0,1,0,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,0,0,
%U 1,0,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0
%N Odd/even-parity of n-th perfect power.
%H Reinhard Zumkeller, <a href="/A076404/b076404.txt">Table of n, a(n) for n = 1..10000</a>
%H C. J. Glasby, S. P. Glasby, F. Pleijel, <a href="https://doi.org/10.1098/rspb.2008.0418">Worms by number</a>, Proc. Roy. Soc. B, Proc. Biol. Sci. 275 (1647) (2008) 2071-2076.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PerfectPower.html">Perfect Powers</a>.
%F A001597(n) mod 2.
%o (Haskell)
%o a076404 = (`mod` 2) . a001597 -- _Reinhard Zumkeller_, Oct 04 2012
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, Oct 09 2002
|
