|
%I #18 Aug 16 2021 17:34:05
%S 0,1,3,7,15,21,31,39,47,57,75,95,111,125,143,159,191,209,243,279,319,
%T 341,383,407,447,473,507,543,575,605,639,671,703,737,803,871,943,1013,
%U 1087,1127,1199,1273,1323,1407,1455,1533
%N a(0)=0, a(n) = (a(n-1) + n) OR n.
%H Ivan Panchenko, <a href="/A182247/b182247.txt">Table of n, a(n) for n = 0..1000</a>
%F a(0)=0, a(n)=(a(n-1)+n) OR n, where OR is the bitwise logical inclusive-OR operator.
%t nxt[{n_,a_}]:={n+1,BitOr[a+n+1,n+1]}; NestList[nxt,{0,0},50][[All,2]] (* _Harvey P. Dale_, Aug 16 2021 *)
%o (Python)
%o a=0
%o for i in range(1,51):
%o print(a, end=',')
%o a += i
%o a |= i
%K base,nonn
%O 0,3
%A _Alex Ratushnyak_, Apr 20 2012
|
