This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182539 #10 May 11 2025 15:41:21
%S A182539 0,1,1,2,2,2,4,6,6,6,8,10,18,26,28,38,54,54,72,90,90,106,124,126,150,
%T A182539 174,192,202,202,210,220,238,238,270,304,306,338,370,372,406,438,438,
%U A182539 472,506,514,554,556,598,630,646,696,698,746,794,828,846,902,910,912,922,938,962,1004,1006,1070
%N A182539 a(n) = a(n-1) + (a(n-2) AND n).
%F A182539 a(0)=0, a(1)=1, a(n) = a(n-1) + (a(n-2) AND n), where AND is the bitwise AND operator.
%t A182539 RecurrenceTable[{a[0]==0,a[1]==1,a[n]==a[n-1]+BitAnd[a[n-2],n]},a,{n,70}] (* _Harvey P. Dale_, Jan 23 2013 *)
%o A182539 (Python)
%o A182539 prpr, prev = 0,1
%o A182539 for n in range(2,99):
%o A182539 current = prev + (prpr & n)
%o A182539 print(prpr, end=' ')
%o A182539 prpr, prev = prev, current
%Y A182539 Cf. A182537.
%K A182539 nonn,base,easy
%O A182539 0,4
%A A182539 _Alex Ratushnyak_, May 04 2012