%I #12 Nov 05 2018 10:34:45
%S 0,1,2,3,6,7,12,11,16,9,10,19,14,15,28,27,40,25,26,43,30,31,52,43,56,
%T 65,26,27,54,47,68,35,32,65,34,35,70,39,44,75,48,41,74,51,46,79,60,59,
%U 104,89,122,139,62,63,116,107,152,65,58,59,118,111,164,99,96,161,98,99,166,103
%N a(n) = (a(n-1) AND a(n-2)) + n.
%H Iain Fox, <a href="/A182538/b182538.txt">Table of n, a(n) for n = 0..10000</a>
%F a(0)=0, a(1)=1, a(n)=(a(n-1) AND a(n-2)) + n, where AND is the bitwise AND operator.
%o (Python)
%o prpr, prev = 0,1
%o for n in range(2,99):
%o . current = (prpr & prev) + n
%o . print prpr,
%o . prpr, prev = prev, current
%o (PARI) first(n)=my(res=vector(n,i,i-1)); for(x=3, n, res[x]=bitand(res[x-1],res[x-2])+x-1); res \\ _Iain Fox_, Nov 05 2018
%Y Cf. A182536.
%K nonn,base,look,easy
%O 0,3
%A _Alex Ratushnyak_, May 04 2012
|