|
%I #25 May 03 2021 07:52:54
%S 0,1,2,5,8,5,10,9,16,9,18,13,24,21,18,17,32,17,34,21,40,21,42,25,48,
%T 41,34,29,56,53,50,49,64,33,66,37,72,37,74,41,80,41,82,45,88,53,82,49,
%U 96,81,66,53,104,85,74,57,112,105,98,93,88,85,82,81,128,65
%N a(0)=0, a(n) = (a(n-1) AND n) + n.
%H Reinhard Zumkeller, <a href="/A182243/b182243.txt">Table of n, a(n) for n = 0..8192=2^13</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AND.html">AND</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Binary_and#AND">Bitwise operation AND</a>
%F a(0) = 0, a(n) = (a(n-1) AND n) + n, where AND is the bitwise logical AND operator.
%t Join[{t = 0}, Table[t = BitAnd[t, n] + n, {n, 100}]] (* _T. D. Noe_, Apr 21 2012 *)
%o (Python)
%o a=0
%o for i in range(1,511):
%o print(a, end=',')
%o a &= i
%o a += i
%o (Haskell)
%o import Data.Bits ((.&.))
%o a182243 n = a182243_list !! n
%o a182243_list = map fst $ iterate f (0,1) where
%o f (y,x) = ((x .&. y) + x, x + 1) :: (Integer,Integer)
%o -- _Reinhard Zumkeller_, Apr 23 2012
%Y Cf. A182242.
%K nonn,base,look
%O 0,3
%A _Alex Ratushnyak_, Apr 20 2012
|
