|
%I #16 Mar 05 2024 07:17:42
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T 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,1,1,1,1,1,
%U 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,1,1,1,1,1
%N First bit in fractional part of binary expansion of 7th root of n.
%C a(n) = 1 if (k-1/2)^7 < n < k^7 for some k, otherwise a(n) = 0. - _Robert Israel_, Mar 04 2024
%H Robert Israel, <a href="/A023974/b023974.txt">Table of n, a(n) for n = 1..10000</a>
%p f:= proc(n) local x;
%p x:= frac(n^(1/7));
%p if is(x < 1/2) then 0 else 1 fi
%p end proc:
%p map(f, [$1..200]); # _Robert Israel_, Mar 04 2024
%t Array[ Function[ n, RealDigits[ N[ Power[ n, 1/7 ], 10 ], 2 ]// (#[ [ 1, #[ [ 2 ] ]+1 ] ])& ], 110 ]
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_, _Olivier Gérard_
|
