A182247 a(0)=0, a(n) = (a(n-1) + n) OR n.
0, 1, 3, 7, 15, 21, 31, 39, 47, 57, 75, 95, 111, 125, 143, 159, 191, 209, 243, 279, 319, 341, 383, 407, 447, 473, 507, 543, 575, 605, 639, 671, 703, 737, 803, 871, 943, 1013, 1087, 1127, 1199, 1273, 1323, 1407, 1455, 1533
Offset: 0
Links
- Ivan Panchenko, Table of n, a(n) for n = 0..1000
Programs
-
Mathematica
nxt[{n_,a_}]:={n+1,BitOr[a+n+1,n+1]}; NestList[nxt,{0,0},50][[All,2]] (* Harvey P. Dale, Aug 16 2021 *)
-
Python
a=0 for i in range(1,51): print(a, end=',') a += i a |= i
Formula
a(0)=0, a(n)=(a(n-1)+n) OR n, where OR is the bitwise logical inclusive-OR operator.