|
%I #22 Jun 28 2021 10:59:37
%S 0,1,2,3,4,6,8,11,10,9,12,16,21,17,22,20,18,23,19,24,31,25,32,41,36,
%T 46,38,48,61,51,64,81,70,88,79,93,75,90,77,95,73,92,76,96,121,104,115,
%U 112,109,119,107,114,111,117,105,116,106,113,110,118,108
%N a(0)=0, a(n+1) = (a(n) XOR floor(a(n)/4)) + 1, where XOR is the bitwise exclusive-or operator.
%C As n -> infinity, a(n) -> infinity.
%H Ivan Neretin, <a href="/A182417/b182417.txt">Table of n, a(n) for n = 0..10000</a>
%t NestList[BitXor[#, Quotient[#, 4]] + 1 &, 0, 60] (* _Ivan Neretin_, Sep 03 2015 *)
%o (PARI)
%o N=100; v=vector(N);
%o for (n=1, N-1, v[n+1] = bitxor( v[n], v[n] \ 8 ) + 1 );
%o v /* show terms */
%o /* _Joerg Arndt_, Apr 28 2012 */
%Y Cf. A182310.
%K nonn,base,look
%O 0,3
%A _Alex Ratushnyak_, Apr 27 2012
|
