|
%I #16 Jul 28 2023 14:55:18
%S 0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T 0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U 1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N First bit in fractional part of binary expansion of 4th root of n.
%C a(n) = 0 if k^4 <= n <= k^4 + 2*k^3 + (3*k^2+k)/2,
%C = 1 if k^4 + 2*k^3 + (3*k^2+k)/2 < n < (k+1)^4. - _Robert Israel_, Aug 18 2014
%H Robert Israel, <a href="/A023971/b023971.txt">Table of n, a(n) for n = 1..10000</a>
%p [seq(floor(2*n^(1/4)) mod 2, n=1..1000)]; # _Robert Israel_, Aug 18 2014
%t Array[ Function[ n, RealDigits[ N[ Power[ n, 1/4 ], 10 ], 2 ]// (#[ [ 1, #[ [ 2 ] ]+1 ] ])& ], 110 ]
%t Table[NumberDigit[Surd[n,4],-1,2],{n,120}] (* _Harvey P. Dale_, Jul 28 2023 *)
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_, _Olivier Gérard_
|
